Saved in:
Bibliographic Details
Main Authors: Kweon, Hyuk Jun, Zhu, Honglin
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2301.02949
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915120962076672
author Kweon, Hyuk Jun
Zhu, Honglin
author_facet Kweon, Hyuk Jun
Zhu, Honglin
contents 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 \in \mathbb{R}^3$ maximizing the overlap area $|P \cap (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.
format Preprint
id arxiv_https___arxiv_org_abs_2301_02949
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Maximum overlap area of a convex polyhedron and a convex polygon under translation
Kweon, Hyuk Jun
Zhu, Honglin
Computational Geometry
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 \in \mathbb{R}^3$ maximizing the overlap area $|P \cap (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.
title Maximum overlap area of a convex polyhedron and a convex polygon under translation
topic Computational Geometry
url https://arxiv.org/abs/2301.02949