Results 1  10
of
5,469
A Simple Recursive Tessellator
, 2000
"... Sometimes there's a need to create a triangular mesh approximation of a parametric surface. If the parameterization is nonuniform (compressed in some areas, stretchy in others), a uniform grid in the domain becomes distorted and provides a bad approximation. We describe how to create an ad ..."
Abstract
 Add to MetaCart
Methods such as [7, 3] use uniform subdivision along isoparametric lines as an initial tessellation. Fo...
Turtles for Tessellations
"... We developed an approach to creating vector graphics representations of tessellations for purposes of teaching creative programming and laser cutting. The approach is based on turtle graphics. The lines of the turtle’s trail define the tiles of the tessellation. The turtle is defined in an objecto ..."
Abstract
 Add to MetaCart
We developed an approach to creating vector graphics representations of tessellations for purposes of teaching creative programming and laser cutting. The approach is based on turtle graphics. The lines of the turtle’s trail define the tiles of the tessellation. The turtle is defined in an object
Adaptive Tesselation of Subdivision Surfaces
, 2003
"... For a variety of reasons subdivision surfaces have developed into a prominent member of the family of freeform shapes. Based on a standard polygonal mesh a modeller can build various kinds of shapes using an arbitrary topology and special geometrical features like creases. However, the interactive d ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
and tesselates each patch recursively using a new data structure, called slate. Besides these geometric properties the algorithm can also adapt to the graphics load in order to achieve a desired frame rate in the scenegraph system OpenSG.
VORONOI TESSELLATIONS FOR MATCHBOX MANIFOLDS
"... Abstract. Matchbox manifolds M are a special class of foliated spaces, which include as special examples the weak solenoids, suspensions of odometer and Toeplitz actions, and tiling spaces associated to aperiodic tilings with finite local complexity. They have many properties analogous to those of a ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
foliated subsets of general matchbox manifolds. This follows from the construction of uniform Voronoi tessellations on leaves, which is the main goal of this work. From this, we define a foliated Delaunay triangulation of M, adapted to the dynamics of F. The result is highly technical, but underlies
Wavelets on Planar Tesselations
, 2000
"... We present a new technique for progressive continuous approximation and compression of polygonal objects in images. Our technique uses local parametrizations de#ned by meshes of convex polygons in the plane. We generalize a lifted biorthogonal wavelet transform to polygonal domains to perform mul ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
multiresolution analysis and compression of image regions. The advantage of our technique over conventional wavelet methods is that the domain is an arbitrary tesselation rather than a rectilinear grid. We expect that this technique has many applications image compression, progressive transmission, radiosity
Tessellations of hyperbolic surfaces
, 2011
"... Abstract. A finite subset S of a closed hyperbolic surface F canonically determines a centered dual decomposition of F: a cell structure with vertex set S, geodesic edges, and 2cells that are unions of the corresponding Delaunay polygons. Unlike a Delaunay polygon, a centered dual 2cell Q is not d ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the Delaunay tessellation among certain genus2 surfaces, and with this relate injectivity radius to covering radius here. A finite subset S of a closed hyperbolic surface F canonically determines a Voronoi tessellation V and Delaunay tessellation P, polygonal decompositions of F that are dual in a certain
Radiosity for Highly Tessellated Models
, 2002
"... The radiosity method is one of the methods of choice used in global illumination simulation. It is a finite element technique that is particularly well suited for computing the radiance distribution in an environment exhibiting only diffuse reflection and emission. We discuss a multiresolution i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
implementation of the technique, that has been developed to rapidly compute radiosity solutions for scenes composed of highly tessellated models. The application context is an interactive lighting design tool being developed in the framework of the DI VERCITY project (EUIST13365), funded under
Adaptive Tessellation for Trimmed NURBS Surface
"... We present an adaptive method for tessellating the trimmed NURBS surface in the parametric domain. Given a model space tolerance ε, the algorithm first splits the NURBS surface in both the U and V directions to fit within the bounding box of the outer trimming loop. Then we subdivide the surface int ..."
Abstract
 Add to MetaCart
We present an adaptive method for tessellating the trimmed NURBS surface in the parametric domain. Given a model space tolerance ε, the algorithm first splits the NURBS surface in both the U and V directions to fit within the bounding box of the outer trimming loop. Then we subdivide the surface
ShapeDriven Nested Markov Tessellations
, 2011
"... A new and rather broad class of stationary (i.e. stochastically translation invariant) random tessellations of the ddimensional Euclidean space is introduced, which are called shapedriven nested Markov tessellations. Locally, these tessellations are constructed by means of a spatiotemporal rand ..."
Abstract
 Add to MetaCart
temporal random recursive split dynamics governed by a family of Markovian split kernel, generalizing thereby the – by now classical – construction of iteration stable random tessellations. By providing an explicit global construction of the tessellations, it is shown that under suitable assumptions on the split
Inscribed Approximation based Adaptive Tessellation
 International Journal of CAD/CAM
"... − CatmullClark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the of faces in the uniformly refined meshes increases exponentially with respect to subdivision depth. Adaptive number reduces the number of faces needed to yield a smooth approximation to th ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
measure error for every point of the limit surface. Hence, it has available, control of the accuracy of the tessellation result. Cracks are avoided by using a recursive color marking process to complete that adjacent patches or subpatches use the same limit surface points in the construction of the shared
Results 1  10
of
5,469