92
Voted
COMPGEOM
2001
ACM
15 years 4 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...
80
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
77
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different
122
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
78
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
73
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
55
Voted
COMPGEOM
2001
ACM
15 years 4 months ago
2001
ACM
111
click to vote
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomo...
DGCI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
102
Voted
DGCI
2006
Springer
15 years 4 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...