Topologically Sweeping Visibility Complexes via Pseudotriangulations (1996)

Cached

Download Links

by M. Pocchiola , G. Vegter
Citations:85 - 9 self

Active Bibliography

31 Computing the Visibility Graph via Pseudo-triangulations – Michel Pocchiola, Gert Vegter - 1995
3 Algorithmique des Graphes de Visibilité – Pierre ANGELIER - 2002
9 Computing the visibility graph of points within a polygon – Boaz Ben-moshe - 2004
146 Geometric Shortest Paths and Network Optimization – Joseph S.B. Mitchell - 1998
8 Segment Endpoint Visibility Graphs are Hamiltonian – Michael Hoffmann, Csaba D. Tóth - 2002
23 Rectilinear Paths among Rectilinear Obstacles – D. T. Lee, C. D. Yang, C. K. Wong - 1996
A Practical Approach for Planar Visibility Maintenance ∗ – Alireza Zarei, Mohammad Ghodsi
1 Spatial Queries in the Presence of Obstacles – Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
85 An Optimal Algorithm for Euclidean Shortest Paths in the Plane – John Hershberger, Subhash Suri - 1997
Computing Shortest Paths amid Pseudodisks ∗ – unknown authors
Graph-based Path Planning for Mobile Robots – David T. Wooden - 2006
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane – John Hershberger, Subhash Suri, Hakan Yıldız
2 Alternating Paths along Axis-parallel Segments – Csaba D. Tóth - 2003
11 A Sum of Squares Theorem for Visibility Complexes and Applications – Pierre Angelier, Michel Pocchiola - 2001
Cluster Connecting Problem inside a Polygon – Y Partha P. Goswami
4 Visibility in Simple Polygons – Prosenjit K. Bose - 1991
24 Efficient Visibility Queries in Simple Polygons – Prosenjit Bose , Anna Lubiw , J. Ian Munro
3 M.: Weak visibility of two objects in planar polygonal scenes – Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi - 2007
15 A Computational Geometric Approach To Visual Hulls – Sylvain Petitjean, Communicated Ming, C. Lin, Dinesh Manocha - 1997