Sciweavers

51 search results - page 10 / 11
» Incremental Triangle Voxelization
Sort
View
APDC
1997
13 years 7 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
CGF
2006
106views more  CGF 2006»
13 years 6 months ago
Silhouette Extraction in Hough Space
Object-space silhouette extraction is an important problem in fields ranging from non-photorealistic computer graphics to medical robotics. We present an efficient silhouette extr...
Matt Olson, Hao Zhang 0002
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 6 months ago
An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
Matthew Fisher, Boris Springborn, Peter Schrö...
MVA
2000
127views Computer Vision» more  MVA 2000»
13 years 5 months ago
Geometric fusion for a hand-held 3D sensor
This article presents a geometric fusion algorithm developed for the reconstruction of 3D surface models from hand-held sensor data. Hand-held systems allow full 3D movement of th...
Adrian Hilton, John Illingworth
SIGGRAPH
1994
ACM
13 years 10 months ago
Zippered polygon meshes from range images
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to ...
Greg Turk, Marc Levoy