AI Chat AI Image Generator AI Video Text to Speech

Maximal Area Triangles in a Convex Polygon

07/13/2017

∙

by Kai Jin, et al.

∙

∙

The widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect by Keikha et. al. [arXiv 1705.11035]. We present an alternative algorithm in this paper. Comparing to the only previously known correct solution, ours is much simpler and more efficient. Moreover, it can be easily extended to compute the minimum area triangle enclosing a convex polygon. Also, our new approach seems powerful in solving other related problems.

page 1

page 2

page 3

page 4

research

∙ 06/09/2017

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

Given the n vertices of a convex polygon in cyclic order, can the triang...

0 Yoav Kallus, et al. ∙

research

∙ 05/06/2017

On Discrete Conformal Seamless Similarity Maps

An algorithm for the computation of global discrete conformal parametriz...

0 Marcel Campen, et al. ∙

research

∙ 12/14/2017

Linear time Minimum Area All-flush Triangles Circumscribing a Convex Polygon

We study the problem of computing the minimum area triangle that circums...

0 Kai Jin, et al. ∙

research

∙ 12/14/2017

Minimum Area All-flush Triangles Circumscribing a Convex Polygon

In this paper, we consider the problem of computing the minimum area tri...

0 Kai Jin, et al. ∙

research

∙ 07/25/2019

A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polygon (Point-in-Polygon)

In this paper we aim to bring new approach into usage of Shoelace Algori...

0 Ochilbek Rakhmanov, et al. ∙

research

∙ 11/01/2017

Finding all Maximal Area Parallelograms in a Convex Polygon

We consider the problem of finding the maximum area parallelogram (MAP) ...

0 Kai Jin, et al. ∙

research

∙ 08/02/2017

Maximum-Area Quadrilateral in a Convex Polygon, Revisited

In this note we show by example that the algorithm presented in 1979 by ...

0 Vahideh Keikha, et al. ∙