A linear-time algorithm for constructing a circular visibility diagram
From MaRDI portal
Publication:1897474
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- 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
- CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON
- Circle Shooting in a Simple Polygon
- Corrections to Lee's visibility polygon algorithm
- 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
(5)- Optimal arc spline approximation
- Numerically robust computation of circular visibility
- A unified approach to conic visibility
- Computing accumulation density of particles on a line with parabolic trajectories.
- Deriving the accumulation density function with parabolic trajectories of particles for arbitrary lines
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)
