The Largest Quadrilateral in a Convex Polygon

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

We present a simple linear-time algorithm for finding the quadrilateral of largest area contained in a convex polygon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2019

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

We present a linear-time algorithm for finding the quadrilateral of larg...
research
12/13/2020

Largest similar copies of convex polygons amidst polygonal obstacles

Given a convex polygon P with k vertices and a polygonal domain Q consis...
research
06/06/2022

Large k-gons in a 1.5D Terrain

Given is a 1.5D terrain 𝒯, i.e., an x-monotone polygonal chain in ℝ^2. F...
research
07/24/2020

Largest triangles in a polygon

We study the problem of finding maximum-area triangles that can be inscr...
research
04/16/2018

k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler

Given an array A of n real numbers, the maximum subarray problem is to f...
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 ...
research
01/08/2023

Maximum overlap area of a convex polyhedron and a convex polygon under translation

Let P be a convex polyhedron and Q be a convex polygon with n vertices i...

Please sign up or login with your details

Forgot password? Click here to reset