92 search results - page 6 / 19 » Stabbers of line segments in the plane |
92
Voted
DCG
2008
15 years 1 months ago
2008
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
102
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
ICVGIP
2004
15 years 3 months ago
2004
This article aims to propose a method to use the idea of Hough Transform (HT) implemented in grey scale images to color images for region extraction. A region in an image is seen ...
114
Voted
CCCG
2008
15 years 3 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...
188
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...