2342 search results - page 238 / 469 » Sublinear geometric algorithms |
140
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
118
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper presents a direct performance-driven placement algorithm for analog integrated circuits. The performance speci cations directly drive the layout tools without intermedi...
138
Voted
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Reliable and generic methods for skew detection are a necessity for any large-scale digitization projects. As one of the first processing steps, skew detection and correction has...
135
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
120
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...