A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon

06/09/2017
by   Yoav Kallus, et al.
0

Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, Löffler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here we give an algorithm with linear time complexity.

READ FULL TEXT

page 9

page 10

page 11

research
07/13/2017

Maximal Area Triangles in a Convex Polygon

The widely known linear time algorithm for computing the maximum area tr...
research
02/23/2019

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance

This paper addresses the problem of finding a representation of a subtre...
research
04/04/2020

Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle

We correct a paper previously submitted to CoRR. That paper claimed that...
research
05/25/2021

A linear parallel algorithm to compute bisimulation and relational coarsest partitions

The most efficient way to calculate strong bisimilarity is by calculatio...
research
05/26/2021

Boltzmann sampling of irreducible context-free structures in linear time

We continue our program of improving the complexity of so-called Boltzma...
research
05/21/2015

Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams

Intrinsic Delaunay triangulation (IDT) is a fundamental data structure i...
research
08/30/2023

Sorting Signed Permutations by Reversals in Nearly-Linear Time

Given a signed permutation on n elements, we need to sort it with the fe...

Please sign up or login with your details

Forgot password? Click here to reset