Sciweavers

346 search results - page 2 / 70
» On the sizes of Delaunay meshes
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Spatio-Temporal Shape from Silhouette using Four-Dimensional Delaunay Meshing
We propose a novel method for computing a fourdimensional (4D) representation of the spatio-temporal visual hull of a dynamic scene, based on an extension of a recent provably cor...
Ehsan Aganj, Jean-Philippe Pons, Florent Sé...
CCCG
2008
13 years 9 months ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
DCG
2010
132views more  DCG 2010»
13 years 7 months ago
Delaunay Refinement for Piecewise Smooth Complexes
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos
SGP
2007
13 years 10 months ago
Delaunay mesh construction
We present algorithms to produce Delaunay meshes from arbitrary triangle meshes by edge flipping and geometrypreserving refinement and prove their correctness. In particular we sh...
Ramsay Dyer, Hao Zhang 0002, Torsten Möller
EWC
2002
97views more  EWC 2002»
13 years 7 months ago
An Experimental Study of Sliver Exudation
We present results on a two-step improvement of mesh quality in three-dimensional Delaunay triangulations. The first step refines the triangulation by inserting sinks and eliminate...
Herbert Edelsbrunner, Damrong Guoy