Computing the external geodesic diameter of a simple polygon

DOI10.1007/BF02247961zbMath0692.68040OpenAlexW1496805800MaRDI QIDQ583892

Jianyong Qiao, Sumit K. Garg

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02247961

zbMATH Keywords

complexityalgorithmpolygoncomputational geometrygeodesic diameterfurthest neighbours

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Related Items (2)

Computing external farthest neighbors for a simple polygon ⋮ Guarding Exterior Region of a Simple Polygon

Cites Work

• Computing the geodesic center of a simple polygon
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A new data structure for representing sorted lists
• Optimal shortest path queries in a simple polygon
• Euclidean shortest paths in the presence of rectilinear barriers
• On Shortest Paths in Polyhedral Spaces
• Optimal Search in Planar Subdivisions
• On a problem of Davenport and Schinzel
• A Combinatorial Problem Connected with Differential Equations

This page was built for publication: Computing the external geodesic diameter of a simple polygon