COMPGEOM
1991
ACM
14 years 4 months ago
1991
ACM
We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arran...
GD
2006
Springer
14 years 4 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
ICPP
1993
IEEE
14 years 4 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
SSIAI
2002
IEEE
14 years 5 months ago
2002
IEEE
This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns of line segments. Areas...
ICPR
2002
IEEE
14 years 5 months ago
2002
IEEE
The application of Hough Transform (HT) has been limited to small-size images for a long time. For large-size images, the peak detection and the line verification become much more...
COMPGEOM
2010
ACM
14 years 5 months ago
2010
ACM
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, ...
COMPGEOM
2010
ACM
14 years 5 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
WPES
2004
ACM
14 years 5 months ago
2004
ACM
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
COMPGEOM
2006
ACM
14 years 6 months ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
ICRA
2006
IEEE
14 years 6 months ago
2006
IEEE
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...