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

01/08/2023
by   Hyuk Jun Kweon, et al.
0

Let P be a convex polyhedron and Q be a convex polygon with n vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector v ∈ℝ^3 maximizing the overlap area |P ∩ (Q + v)| in O(n log^2 n) time. We then apply our algorithm to solve two related problems. We give an O(n log^3 n) time algorithm that finds the maximum overlap area of three convex polygons with n vertices in total. We also give an O(n log^2 n) time algorithm that minimizes the symmetric difference of two convex polygons under scaling and translation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2023

Maximum Overlap Area of Several Convex Polygons Under Translations

Let k ≥ 2 be a constant. Given any k convex polygons in the plane with a...
research
10/19/2019

Maximum-Area Rectangles in a Simple Polygon

We study the problem of finding maximum-area rectangles contained in a p...
research
06/18/2020

Efficient Planar Two-Center Algorithms

We consider the planar Euclidean two-center problem in which given n poi...
research
05/27/2019

The Largest Quadrilateral in a Convex Polygon

We present a simple linear-time algorithm for finding the quadrilateral ...
research
11/15/2020

A Picture's Worth a Thousand Words: Visualizing n-dimensional Overlap in Logistic Regression Models with Empirical Likelihood

In this note, conditions for the existence and uniqueness of the maximum...
research
02/25/2021

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs

The hierarchical overlap graph (HOG) is a graph that encodes overlaps fr...
research
06/03/2018

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks

Evacuation in emergency situations can be modeled by a dynamic flow netw...

Please sign up or login with your details

Forgot password? Click here to reset