7 search results - page 1 / 2 » Delaunay Triangulations in O(sort(n)) Time and More |
FOCS
2009
IEEE
13 years 2 months ago
2009
IEEE
APDC
1997
13 years 6 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
MFCS
1994
Springer
13 years 9 months ago
1994
Springer
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
ICCAD
2005
IEEE
14 years 1 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...