Numerically robust computation of circular visibility

DOI10.1016/j.cagd.2017.11.003zbMath1381.65018arXiv1611.03356OpenAlexW2774042655MaRDI QIDQ1693670

Stephan Brummer, Georg Maier, Thomas Sauer

Publication date: 31 January 2018

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.03356

zbMATH Keywords

algorithmchannelarc splinecircular visibility

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• A linear-time algorithm for constructing a circular visibility diagram
• Optimal arc spline approximation
• BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
• The Problem of Apollonius
• Unnamed Item

This page was built for publication: Numerically robust computation of circular visibility