Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912272980377600 |
|---|---|
| author | Bigham, Bahram Sadeghi |
| author_facet | Bigham, Bahram Sadeghi |
| contents | In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore, it has been illustrated that the new problem known as "Two Disjoint Convex Hulls" can be solved in polynomial time due to some combinatorial aspects and geometric properties. For this purpose, an $O(n^2)$ algorithm has also been presented which employs the Separating Axis Theorem (SAT) and the duality of points/lines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2106_09974 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls Bigham, Bahram Sadeghi Computational Geometry 68W01, 68U05 In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore, it has been illustrated that the new problem known as "Two Disjoint Convex Hulls" can be solved in polynomial time due to some combinatorial aspects and geometric properties. For this purpose, an $O(n^2)$ algorithm has also been presented which employs the Separating Axis Theorem (SAT) and the duality of points/lines. |
| title | Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls |
| topic | Computational Geometry 68W01, 68U05 |
| url | https://arxiv.org/abs/2106.09974 |