Sciweavers

12 search results - page 1 / 3
» Localized Delaunay Refinement for Sampling and Meshing
Sort
View
CGF
2010
153views more  CGF 2010»
13 years 4 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
SGP
2007
13 years 7 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
VIS
2007
IEEE
199views Visualization» more  VIS 2007»
14 years 5 months ago
Topology, Accuracy, and Quality of Isosurface Meshes Using Dynamic Particles
Abstract-This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles...
Miriah Meyer, Robert M. Kirby, Ross Whitaker
IMR
2004
Springer
13 years 10 months ago
Robust Three Dimensional Delaunay Refinement
The Delaunay Refinement Algorithm for quality meshing is extended to three dimensions. The algorithm accepts input with arbitrarily small angles, and outputs a Conforming Delauna...
Steven E. Pav, Noel Walkington
ECCV
2008
Springer
14 years 6 months ago
Anisotropic Geodesics for Perceptual Grouping and Domain Meshing
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
Sébastien Bougleux, Gabriel Peyré, L...