62 search results - page 6 / 13 » Triangulations of Line Segment Sets in the Plane |
IVC
2007
13 years 7 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
CCCG
2008
13 years 9 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...
BIRTHDAY
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
ISVD
2007
IEEE
14 years 1 months ago
2007
IEEE
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
IPL
2006
13 years 7 months ago
2006
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...