Finding a Largest-Area Triangle in a Terrain in Near-Linear Time

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(n logn) 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).

[1]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[2]  Gunter Rote.  The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon , 2019 .

[3]  Leonidas J. Guibas,et al.  Finding extremal polygons , 1982, STOC '82.

[4]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[5]  Jan Kyncl,et al.  Peeling potatoes near-optimally in near-linear time , 2017, SIAM J. Comput..

[6]  Chee-Keng Yap,et al.  A polynomial solution for the potato-peeling problem , 1986, Discret. Comput. Geom..

[7]  Joseph S. B. Mitchell,et al.  Finding large sticks and potatoes in polygons , 2006, SODA '06.

[8]  Maarten Löffler,et al.  Maximum-Area Triangle in a Convex Polygon, Revisited , 2017, Inf. Process. Lett..

[9]  David M. Mount,et al.  A parallel algorithm for enclosed and enclosing triangles , 1992, Int. J. Comput. Geom. Appl..

[10]  Sandip Das,et al.  Largest Triangle inside a Terrain , 2019, CCCG.

[11]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[12]  Elefterios A. Melissaratos,et al.  Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions , 1992, SIAM J. Comput..

[13]  David P. Dobkin,et al.  On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[15]  Otfried Cheong,et al.  Finding largest rectangles in convex polygons , 2016, Comput. Geom..

[16]  Yoav Kallus.  A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon , 2017, ArXiv.

[17]  Leonidas J. Guibas,et al.  Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.

[18]  Jacob E. Goodman,et al.  On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato , 1981 .

[19]  Leonidas J. Guibas,et al.  Algorithms for bichromatic line-segment problems and polyhedral terrains , 1994, Algorithmica.