Linear algorithm to find the largest intriangles of a planar convex polygon
Abstract
Presents a linear time algorithm to find the maximum area triangle enclosed in a planar convex region. The algorithm is based on inspecting a selected set of chords in a decreasing sequence of slopes and the number of chords so inspected is proportional to total number of vertices resulting in a linear time algorithm. Addresses the problem because of its importance in robotics, computational geometry and other research areas.
Keywords
Citation
Pujari, A.K. and Nataraj, A. (1996), "Linear algorithm to find the largest intriangles of a planar convex polygon", Kybernetes, Vol. 25 No. 5, pp. 53-59. https://doi.org/10.1108/03684929610124122
Publisher
:MCB UP Ltd
Copyright © 1996, MCB UP Limited