51 search results - page 1 / 11 » Fast Localized Delaunay Triangulation |
115
Voted
OPODIS
2004
15 years 9 days ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
102
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
107
Voted
IM
2008
14 years 11 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
110
Voted
CGF
2000
14 years 10 months ago
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
108
Voted
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...