3025 search results - page 225 / 605 » Computational geometry: a retrospective |
182
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
167
click to vote
COMPGEOM
1999
ACM
15 years 11 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
156
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
156
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
175
click to vote
COMPGEOM
2007
ACM
15 years 10 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 ...