Visibility between two edges of a simple polygon
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A combinational approach to polygon similarity
- A combinatorial theorem in plane geometry
- A linear algorithm for computing the visibility polygon from a point
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- A new data structure for representing sorted lists
- A simple linear hidden-line algorithm for star-shaped polygons
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Applications of a two-dimensional hidden-line algorithm to other geometric problems
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Shortest paths in the plane with convex polygonal obstacles
- Triangulating a simple polygon
- Visibility of a simple polygon
Cited in
(19)- Reconstructing visible regions from visible segments
- Reasoning about visibility
- Corrections to Lee's visibility polygon algorithm
- Tracing compressed curves in triangulated surfaces
- scientific article; zbMATH DE number 1424307 (Why is no real title available?)
- Visibility Algorithms in the Plane
- Line segment visibility with sidedness constraints
- Characterizing and recognizing LR-visibility polygons
- Three dimensional weak visibility: Complexity and applications
- Visibility of a simple polygon
- scientific article; zbMATH DE number 4078149 (Why is no real title available?)
- Computing shortest transversals
- Some chain visibility problems in a simple polygon
- Shortest path solves edge-to-edge visibility in a polygon
- Three-dimensional weak visibility: Complexity and applications
- Computing the visibility polygon from an edge
- scientific article; zbMATH DE number 4050998 (Why is no real title available?)
- Open guard edges and edge guards in simple polygons
- Visibility of disjoint polygons
This page was built for publication: Visibility between two edges of a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096432)