126 search results - page 19 / 26 » Self-improving algorithms for delaunay triangulations |
SMI
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
97
Voted
CCCG
2003
14 years 11 months ago
2003
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
66
Voted
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
73
Voted
COMGEO
2007
ACM
14 years 9 months ago
2007
ACM
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...