126 search results - page 18 / 26 » Self-improving algorithms for delaunay triangulations |
195
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
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 ...
186
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
167
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
147
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
135
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we present a novel flip-chip routing algorithm for package-board co-design. Unlike the previous works that can consider only either free- or pre-assignment routing,...