Results 11  20
of
94,851
Smoothness analysis of subdivision schemes on regular grids by proximity
, 2006
"... Subdivision is a very powerful way of approximating a continuous object f(x, y) by a sequence ((Slpi,j)i,j∈Z)l∈N of discrete data on finer and finer grids. The rule S, that maps an approximation on a coarse grid, Slp, to the approximation on the next finer grid, Sl+1p, is called subdivision scheme. ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Subdivision is a very powerful way of approximating a continuous object f(x, y) by a sequence ((Slpi,j)i,j∈Z)l∈N of discrete data on finer and finer grids. The rule S, that maps an approximation on a coarse grid, Slp, to the approximation on the next finer grid, Sl+1p, is called subdivision scheme
Global Static Indexing for Realtime Exploration of Very Large Regular Grids
, 2001
"... In this paper we introduce a new indexing scheme for progressive traversal and visualization of large regular grids. We demonstrate the potential of our approach by providing a tool that displays at interactive rates planar slices of scalar field data with very modest computing resources. We obtain ..."
Abstract

Cited by 65 (9 self)
 Add to MetaCart
In this paper we introduce a new indexing scheme for progressive traversal and visualization of large regular grids. We demonstrate the potential of our approach by providing a tool that displays at interactive rates planar slices of scalar field data with very modest computing resources. We obtain
ContourBased Polygonization of Regular Grid Terrain Data
"... Terrain visualization has been an interesting issue for graphics people for long, and there have been a lot of attempts in various ways for more e#cient visualization. In most of the works the terrain data was considered as a triangular mesh as it is, or as an implicit surface in which the original ..."
Abstract
 Add to MetaCart
Terrain visualization has been an interesting issue for graphics people for long, and there have been a lot of attempts in various ways for more e#cient visualization. In most of the works the terrain data was considered as a triangular mesh as it is, or as an implicit surface in which the original shape#topology# of the terrain can be slightly changed.
Generating Locally Optimal Partitions for the Regular GridGraph Problem
, 2001
"... Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. In some cases, the solutions generated using these techniques produced solutions for which obvious improvements exist. ..."
Abstract
 Add to MetaCart
Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. In some cases, the solutions generated using these techniques produced solutions for which obvious improvements exist.
Footprint evaluation for volume rendering
 Computer Graphics
, 1990
"... This paper presents a forward mapping rendering algorithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer calcul ..."
Abstract

Cited by 501 (1 self)
 Add to MetaCart
This paper presents a forward mapping rendering algorithm to display regular volumetric grids that may not have the same spacings in the three grid directions. It takes advantage of the fact that convolution can be thought of as distributing energy from input samples into space. The renderer
Dynamic Scene Occlusion Culling using a Regular Grid
 Proceedings of the XV Brazilian Symposium on Computer Graphics and Image Processing
, 2001
"... We present an outputsensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular grid that represents a volumetric discretization of the space and uses the opaque regions of the scene as virtual occl ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We present an outputsensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular grid that represents a volumetric discretization of the space and uses the opaque regions of the scene as virtual
1FFT Interpolation from Nonuniform Samples Lying in a Regular Grid
"... Abstract—This paper presents an FFTbased method to interpolate a periodic bandlimited signal from its samples lying at nonuniform positions in a regular grid. The method can be viewed as a generalization of the wellknown zeropadding FFT algorithm. The main difference to this last method is that ..."
Abstract
 Add to MetaCart
Abstract—This paper presents an FFTbased method to interpolate a periodic bandlimited signal from its samples lying at nonuniform positions in a regular grid. The method can be viewed as a generalization of the wellknown zeropadding FFT algorithm. The main difference to this last method
A DynamicProgramming Heuristic for Regular GridGraph Partitioning
, 2000
"... Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. These earlier methods differed in the domains of application and the stripeheight selection process, and did not have polynomial runtim ..."
Abstract
 Add to MetaCart
Previous researchers have demonstrated that striping heuristics produce very good (and, in some cases, asymptotically optimal) partitions for regular grid graphs. These earlier methods differed in the domains of application and the stripeheight selection process, and did not have polynomial run
The L(2, 1)Labeling Problem on Oriented Regular Grids
, 2009
"... The L(2,1)labeling of a digraph G is a function f from the node set of G to the set of all nonnegative integers such that f(x) − f(y)  ≥ 2 if x and y are at distance 1, and f(x) ̸ = f(y) if x and y are at distance 2, where the distance from vertex x to vertex y is the length of a shortest dipat ..."
Interactive Implicit Modelling Based on C¹ Continuous Reconstruction of Regular Grids
 International Journal of Shape Modeling
, 2002
"... Our goal is to provide a kernel to allow interactive and accurate modelling of volume objects. As a first step, we present a data structure for threedimensional fields C¹ continuous in the modelling space. Regular grids storing the field values discretely are combined with a triquadratic approximat ..."
Abstract
 Add to MetaCart
Our goal is to provide a kernel to allow interactive and accurate modelling of volume objects. As a first step, we present a data structure for threedimensional fields C¹ continuous in the modelling space. Regular grids storing the field values discretely are combined with a triquadratic
Results 11  20
of
94,851