Sciweavers

415 search results - page 7 / 83
» A Fast Algorithm for Delaunay Based Surface Reconstruction
Sort
View
ICIP
2007
IEEE
14 years 9 months ago
Dart: A Fast Heuristic Algebraic Reconstruction Algorithm for Discrete Tomography
Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of gray levels. DT reconstruction problems are usually unde...
Kees Joost Batenburg, Jan Sijbers
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 24 days ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
COMPUTING
2007
126views more  COMPUTING 2007»
13 years 7 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ö...
VIP
2001
13 years 9 months ago
Facial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature ex...
Yi Xiao, Hong Yan
JMIV
2002
100views more  JMIV 2002»
13 years 7 months ago
Analysis of Echoes in Single-Image Random-Dot-Stereograms
Three-dimensional depth information of a surface can be encoded in a two-dimensional image called single-image random-dotstereograms or, more widely known, autostereograms. It is ...
Mark S. K. Lau, C. P. Kwong