459 search results - page 17 / 92 » Delaunay mesh construction |
SGP
2003
15 years 1 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
106
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
105
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
GIS
2002
ACM
14 years 11 months ago
2002
ACM
A method is presented for generalising cartographic lines using an approach based on determination of their structure. Constrained Delaunay triangulation is used to construct a ske...