A unified approach to conic visibility

DOI10.1007/S004530010042MaRDI QIDQ1587782zbMATH OpenOpenAlexFDO

Authors J. García-López, Pedro Ramos

Publication date 3 December 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010042

zbMATH Keywords

visibility polygonray shootingsplinegoncurved triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A linear-time algorithm for constructing a circular visibility diagram
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• THE VISIBILITY COMPLEX
• scientific article; zbMATH DE number 2077120
• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON

Cited in

(4)

• Weak visibility polygons of NURBS curves inside simple polygons
• Computing push plans for disk-shaped robots
• A linear-time algorithm for constructing a circular visibility diagram
• Visibility in semi-convex spaces

This page was built for publication: A unified approach to conic visibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587782)