92 search results - page 1 / 19 » Stabbers of line segments in the plane |
COMGEO
2011
ACM
13 years 5 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
FSTTCS
2007
Springer
14 years 5 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...
CCCG
2007
14 years 10 days ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
COMPGEOM
2010
ACM
14 years 4 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, ...