Visibility between two edges of a simple polygon
From MaRDI portal
Publication:1096432
DOI10.1007/BF01952419zbMath0633.68119OpenAlexW1985853221MaRDI QIDQ1096432
Godfried T. Toussaint, Teren Gum, David Avis
Publication date: 1986
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01952419
image processingpolygonroboticsvisibilitycomputational geometrygraphics automated cartographyhidden line problems
Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (5)
Three dimensional weak visibility: Complexity and applications ⋮ Open Guard Edges and Edge Guards in Simple Polygons ⋮ Tracing compressed curves in triangulated surfaces ⋮ Computing shortest transversals ⋮ Three-dimensional weak visibility: Complexity and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shortest paths in the plane with convex polygonal obstacles
- A linear algorithm for eliminating hidden-lines from a polygonal cylinder
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A new data structure for representing sorted lists
- Triangulating a simple polygon
- A combinatorial theorem in plane geometry
- Applications of a two-dimensional hidden-line algorithm to other geometric problems
- A simple linear hidden-line algorithm for star-shaped polygons
- Visibility of a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Design and Analysis of a Data Structure for Representing Sorted Lists
- A linear algorithm for computing the visibility polygon from a point
- A combinational approach to polygon similarity
- An Optimal Algorithm for Finding the Kernel of a Polygon
- An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line Problem
This page was built for publication: Visibility between two edges of a simple polygon
