Finding a shortest diagonal of a simple polygon in linear time

DOI10.1016/0925-7721(95)00032-1zbMath0870.68149OpenAlexW2041863277MaRDI QIDQ676568

Subhash Suri, J. E. Hershberger

Publication date: 6 May 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00032-1

zbMATH Keywords

shortest diagonalvisibility constraint

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Voronoi diagrams with barriers and the shortest diagonal problem
• Triangulating a simple polygon in linear time
• Optimal time bounds for some proximity problems in the plane
• Computing the shortest diagonal of a monotone polygon in linear time
• Matrix searching with the shortest path metric
• Unnamed Item

This page was built for publication: Finding a shortest diagonal of a simple polygon in linear time