Sciweavers

Share
DCG
2008
82views more  DCG 2008»
9 years 10 months ago
Visibility Graphs of Point Sets in the Plane
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...
Florian Pfender
COMPGEOM
2004
ACM
10 years 3 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
10 years 4 months ago
Minimum Wheel-Rotation Paths for Differential Drive Mobile Robots Among Piecewise Smooth Obstacles
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
Hamid Reza Chitsaz, Steven M. LaValle
books