Computing the longest diagonal of a simple polygon

DOI10.1016/0020-0190(90)90167-VzbMath0704.68051OpenAlexW1989224927MaRDI QIDQ917298

Alok Aggarwal, Subhash Suri

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90167-v

zbMATH Keywords

computational geometrypolygonslongest diagonal problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

Can visibility graphs be represented compactly?, Selection in monotone matrices and computing k th nearest neighbors, Efficient randomized algorithms for some geometric optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric applications of a matrix-searching algorithm
• A linear algorithm for computing the visibility polygon from a point