Sciweavers

49 search results - page 6 / 10
» Computability of Partial Delaunay Triangulation and Voronoi ...
Sort
View
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
14 years 6 days ago
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
Deepak Bandyopadhyay, Jack Snoeyink
COMPGEOM
2008
ACM
14 years 19 days ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 4 months 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
ADHOCNETS
2009
Springer
14 years 5 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
SMA
1995
ACM
217views Solid Modeling» more  SMA 1995»
14 years 2 months ago
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...
Kenji Shimada, David C. Gossard