Sciweavers

7 search results - page 1 / 2
» An algorithm for three-dimensional Voronoi S-network
Sort
View
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
13 years 8 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
CVPR
2001
IEEE
14 years 6 months ago
Three-Dimensional Medial Shape Representation Incorporating Object Variability
This paper presents a novel processing scheme for the automatic computation of a medial shape model which is representative for an object population with shape variability. The se...
Martin Styner, Guido Gerig
COMPGEOM
2000
ACM
13 years 9 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
SMI
2007
IEEE
176views Image Analysis» more  SMI 2007»
13 years 11 months ago
Delaunay Meshing of Isosurfaces
We present an isosurface meshing algorithm, DELISO, based on the Delaunay refinement paradigm. This paradigm has been successfully applied to mesh a variety of domains with guara...
Tamal K. Dey, Joshua A. Levine
SMA
2006
ACM
120views Solid Modeling» more  SMA 2006»
13 years 10 months ago
Identifying flat and tubular regions of a shape by unstable manifolds
We present an algorithm to identify the flat and tubular regions of a three dimensional shape from its point sample. We consider the distance function to the input point cloud an...
Samrat Goswami, Tamal K. Dey, Chandrajit L. Bajaj