Computing the shortest diagonal of a monotone polygon in linear time

DOI10.1016/0020-0190(92)90227-MzbMath0773.68074OpenAlexW2063871281MaRDI QIDQ1198084

Binhai Zhu

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90227-m

zbMATH Keywords

monotone polygonshortest diagonal

Mathematics Subject Classification ID

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

Related Items (1)

Finding a shortest diagonal of a simple polygon in linear time

Cites Work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Triangulating Simple Polygons and Equivalent Problems
• Unnamed Item

This page was built for publication: Computing the shortest diagonal of a monotone polygon in linear time