Efficient multi-agent path planning
Proceedings of the Eurographic workshop on Computer animation and simulation
Visibility queries in a polygonal region
Computational Geometry: Theory and Applications
Planar rectilinear shortest path computation using corridors
Computational Geometry: Theory and Applications
Finding a rectilinear shortest path in R2using corridor based staircase structures
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Industrial design using interpolatory discrete developable surfaces
Computer-Aided Design
| Hi-index | 0.00 |
This paper describes an output-sensitive scheme to construct the visibility graph of a simple polygon with m obstacles and n vertices in optimal O(|E| +T + m log n ) time where |E| is the size of the visibility graph and T is the time required to triangulate the simple polygon with obstacles. We use a partition of the space into regions called corridors which eases the efforts of the construction. Our algorithms are simple and the data structures used are only linked lists.