Finding a largest-area triangle in a terrain in near-linear time

Authors

• Sergio Cabello, Univerza v Ljubljani
• Arun Kumar Das, Indian Statistical Institute, Kolkata
• Sandip Das, Indian Statistical Institute, Kolkata
• Joydeep Mukherjee, Ramakrishna Mission Vivekananda Educational and Research Institute

Article Type

Research Article

Publication Title

Computational Geometry Theory and Applications

Abstract

A terrain is an x-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in O(nlog⁡n) time, where n is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of O(n²).

DOI

10.1016/j.comgeo.2025.102171

Publication Date

9-1-2025

Recommended Citation

Cabello, Sergio; Das, Arun Kumar; Das, Sandip; and Mukherjee, Joydeep, "Finding a largest-area triangle in a terrain in near-linear time" (2025). Journal Articles. 5370.
https://digitalcommons.isical.ac.in/journal-articles/5370