Sciweavers

346 search results - page 10 / 70
» On the sizes of Delaunay meshes
Sort
View
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
14 years 1 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
IMR
2004
Springer
14 years 26 days ago
Reliable Isotropic Tetrahedral Mesh Generation Based on an Advancing Front Method
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...
Yasushi Ito, Alan M. Shih, Bharat K. Soni
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
14 years 8 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
ICCV
2007
IEEE
14 years 9 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
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ö...