Numerically robust computation of circular visibility
From MaRDI portal
Abstract: We address the question of whether a point inside a domain bounded by a simple closed arc spline is circularly visible from a specified arc from the boundary. We provide a simple and numerically stable linear time algorithm that solves this problem. In particular, we present an easy-to-check criterion that implies that a point is not visible from a specified boundary arc.
Recommendations
Cites work
- A linear-time algorithm for constructing a circular visibility diagram
- BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
- CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
- Optimal arc spline approximation
- The Problem of Apollonius
- Winding around. The winding number in topology, geometry, and analysis
Cited in
(3)
This page was built for publication: Numerically robust computation of circular visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693670)