CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON

DOI10.1142/S0218195993000026zbMath0793.52002OpenAlexW2012485564MaRDI QIDQ5289292

Micha Sharir, Pankaj K. Agarwal

Publication date: 22 August 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195993000026

zbMATH Keywords

visibilitypoint locationsimple polygonray shooting

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Related Items (3)

A linear-time algorithm for constructing a circular visibility diagram ⋮ Numerically robust computation of circular visibility ⋮ On circularly-hidden surface removal.

This page was built for publication: CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON