AI Chat AI Image Generator AI Video Text to Speech

The Largest Contained Quadrilateral and the Smallest Enclosing Parallelogram of a Convex Polygon

05/27/2019
∙
by   Günter Rote, et al.
∙
0
∙

We present a linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon, and we show that it is closely related to an old algorithm for the smallest enclosing parallelogram of a convex polygon.

READ FULL TEXT

Related Research

research
∙ 05/27/2019

The Largest Quadrilateral in a Convex Polygon

We present a simple linear-time algorithm for finding the quadrilateral ...
0 Günter Rote, et al. ∙
research
∙ 05/31/2017

Maximum-Area Triangle in a Convex Polygon, Revisited

We revisit the following problem: Given a convex polygon P, find the lar...
0 Vahideh Keikha, et al. ∙
research
∙ 04/08/2020

Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020

We give an overview of the 2020 Computational Geometry Challenge, which ...
0 Erik D. Demaine, et al. ∙
research
∙ 12/24/2017

Largest and Smallest Area Triangles on a Given Set of Imprecise Points

In this paper we study the following problem: we are given a set of impr...
0 Vahideh Keikha, et al. ∙
research
∙ 04/23/2021

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...
0 Sergio Cabello, et al. ∙
research
∙ 08/12/2019

An Adaptive s-step Conjugate Gradient Algorithm with Dynamic Basis Updating

The adaptive s-step CG algorithm is a solver for sparse, symmetric posit...
0 Erin C. Carson, 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. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal