pith. sign in

arxiv: 1611.03356 · v2 · pith:BTBKAZ4Enew · submitted 2016-11-09 · 💻 cs.CG

Numerically robust computation of circular visibility

classification 💻 cs.CG
keywords boundarynumericallypointsimplespecifiedvisibleaddressalgorithm
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.