|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
13 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Maximum Overlap Area of Several Convex Polygons Under Translations | | Hyuk Jun Kweon
; Honglin Zhu
; | | Date: |
1 Jul 2023 | | Abstract: | Let $k geq 2$ be a constant. Given any $k$ convex polygons in the plane with
a total of $n$ vertices, we present an $O(nlog^{2k-3}n)$ time algorithm that
finds a translation of each of the polygons such that the area of intersection
of the $k$ polygons is maximized. Given one such placement, we also give an
$O(n)$ time algorithm which computes the set of all translations of the
polygons which achieve this maximum. | | Source: | arXiv, 2307.00409 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER