A linear-time algorithm for constructing a circular visibility diagram
From MaRDI portal
Publication:1897474
DOI10.1007/BF01206329zbMATH Open0831.68106OpenAlexW2050804178MaRDI QIDQ1897474FDOQ1897474
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The power of geometric duality
- Triangulating a simple polygon in linear time
- Topologically sweeping an arrangement
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A linear time algorithm for minimum link paths inside a simple polygon
- Visibility and intersection problems in plane geometry
- Corrections to Lee's visibility polygon algorithm
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Visibility of a simple polygon
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- The power of geometric duality revisited
- Circle Shooting in a Simple Polygon
- CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
Cited In (5)
- Computing accumulation density of particles on a line with parabolic trajectories.
- Numerically robust computation of circular visibility
- Optimal arc spline approximation
- Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines
- A unified approach to conic visibility
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)
