A linear-time algorithm for constructing a circular visibility diagram

DOI10.1007/BF01206329MaRDI QIDQ1897474zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
• scientific article; zbMATH DE number 177568
• Numerically robust computation of circular visibility
• Visibility of a simple polygon
• A unified approach to conic visibility

Cites work

• A linear time algorithm for minimum link paths inside a simple polygon
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Circle Shooting in a Simple Polygon
• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
• Corrections to Lee's visibility polygon algorithm
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• The power of geometric duality
• The power of geometric duality revisited
• Topologically sweeping an arrangement
• Triangulating a simple polygon in linear time
• Visibility and intersection problems in plane geometry
• Visibility of a simple polygon

Cited in

(6)

• A unified approach to conic visibility
• Numerically robust computation of circular visibility
• Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines
• Optimal arc spline approximation
• CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
• Computing accumulation density of particles on a line with parabolic trajectories.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897474)