DeepAI AI Chat
Log In Sign Up

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

by   Hyuk Jun Kweon, et al.

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.


page 1

page 2

page 3

page 4


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...

Maximum-Area Rectangles in a Simple Polygon

We study the problem of finding maximum-area rectangles contained in a p...

Efficient Planar Two-Center Algorithms

We consider the planar Euclidean two-center problem in which given n poi...

The Largest Quadrilateral in a Convex Polygon

We present a simple linear-time algorithm for finding the quadrilateral ...

A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs

The hierarchical overlap graph (HOG) is a graph that encodes overlaps fr...

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

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