102291 search results - page 266 / 20459 » Computability in Computational Geometry |
170
click to vote
DGCI
2006
Springer
15 years 10 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...
165
click to vote
COMPGEOM
2001
ACM
15 years 10 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...
165
click to vote
COMPGEOM
2000
ACM
15 years 10 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...
199
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
157
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...