94 search results - page 1 / 19 » Visibility Graphs of Point Sets in the Plane |
DCG
2008
13 years 5 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...
IJCGA
2007
13 years 4 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
COMPGEOM
1990
ACM
13 years 9 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...