2980 search results - page 220 / 596 » Computational Geometry |
122
Voted
CAAN
2007
Springer
15 years 7 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...
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 ...
125
Voted
DGCI
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
123
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
2001
ACM
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of n lines in the plane, we show how to construct another arrangement consisting of man...
128
Voted
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...