Linear algorithm to find the largest intriangles of a planar convex polygon

DOI10.1108/03684929610124122zbMath0935.68123OpenAlexW2031837617MaRDI QIDQ4246478

Arun K. Pujari, A. Nataraj

Publication date: 6 June 1999

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03684929610124122

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38)

Cites Work

• On triangulations of the convex hull of n points
• Largest polygons with vertices in a given finite set
• Solving related two- and three-dimensional linear programming problems in logarithmic time
• An optimal algorithm for finding minimal enclosing triangles
• An Extremal Problem of Geometry

This page was built for publication: Linear algorithm to find the largest intriangles of a planar convex polygon