A linear-time algorithm for constructing a circular visibility diagram

DOI10.1007/BF01206329zbMath0831.68106OpenAlexW2050804178MaRDI QIDQ1897474

Shou-Yan Chou, Tony C. Woo

Publication date: 27 August 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01206329

zbMATH Keywords

circular visibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Numerically robust computation of circular visibility ⋮ Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines ⋮ Computing accumulation density of particles on a line with parabolic trajectories. ⋮ Optimal arc spline approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Visibility and intersection problems in plane geometry
• The power of geometric duality revisited
• The power of geometric duality
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Corrections to Lee's visibility polygon algorithm
• Topologically sweeping an arrangement
• Triangulating a simple polygon in linear time
• A linear time algorithm for minimum link paths inside a simple polygon
• Visibility of a simple polygon
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Circle Shooting in a Simple Polygon
• An Optimal Algorithm for Finding the Kernel of a Polygon
• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON

This page was built for publication: A linear-time algorithm for constructing a circular visibility diagram