5 search results - page 1 / 1 » Stabbing Circles for Sets of Segments in the Plane |
COMGEO
2011
ACM
12 years 11 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
13 years 10 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...
CCCG
2008
13 years 6 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...