49 search results - page 5 / 10 » Computability of Partial Delaunay Triangulation and Voronoi ... |
98
Voted
COMGEO
2004
ACM
15 years 8 days ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
95
Voted
ISVD
2007
IEEE
15 years 6 months ago
2007
IEEE
Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D ...
93
Voted
CIE
2005
Springer
15 years 6 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...
115
Voted
P2P
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extensio...
94
Voted
TCS
2008
15 years 10 days ago
2008
F. Labelle and J. Shewchuk [3] have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the...