To read this content please select one of the options below:

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

Arun K. Pujari (University of Hyderabad, Hyderabad, India)
A. Nataraj (University of Hyderabad, Hyderabad, India)

Kybernetes

ISSN: 0368-492X

Article publication date: 1 July 1996

92

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

Related articles