2018
DOI: 10.1016/j.cagd.2017.11.003
|View full text |Cite
|
Sign up to set email alerts
|

Numerically robust computation of circular visibility

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 7 publications
0
0
0
Order By: Relevance