dc.citation.conferencePlace |
IT |
- |
dc.citation.conferencePlace |
Pisa |
- |
dc.citation.endPage |
363 |
- |
dc.citation.startPage |
356 |
- |
dc.citation.title |
21st Annual Symposium on Computational Geometry, SCG'05 |
- |
dc.contributor.author |
Ahn, Hee-Kap |
- |
dc.contributor.author |
Cheong, Otfried |
- |
dc.contributor.author |
Park, Chong-Dae |
- |
dc.contributor.author |
Shin, Chan-Su |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-20T05:36:33Z |
- |
dc.date.available |
2023-12-20T05:36:33Z |
- |
dc.date.created |
2016-07-04 |
- |
dc.date.issued |
2005-06-06 |
- |
dc.description.abstract |
Given two compact convex sets P and Q in the plane, we compute an image of P under a rigid motion that approximately maximizes the overlap with Q. More precisely, for any ε > 0, we compute a rigid motion such that the area of overlap is at least 1 -ε times the maximum possible overlap. Our algorithm uses O(l/ε) extreme point and line intersection queries on P and Q, plus O((1/ε2)log(1/ε)) running time. If only translations are allowed, the extra running time reduces to O((1/ε) log(1/ε)). If P and Q are convex polygons with n vertices in total, the total running time is O((1/ε) logn+(1/ε2) log(1/ε)) for rigid motions and O((1/ε) log n + (1/ε) log(1/ε)) for translations. |
- |
dc.identifier.bibliographicCitation |
21st Annual Symposium on Computational Geometry, SCG'05, pp.356 - 363 |
- |
dc.identifier.doi |
10.1145/1064092.1064146 |
- |
dc.identifier.scopusid |
2-s2.0-33244493774 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34493 |
- |
dc.identifier.url |
http://dl.acm.org/citation.cfm?id=1064146 |
- |
dc.language |
영어 |
- |
dc.publisher |
21st Annual Symposium on Computational Geometry, SCG'05 |
- |
dc.title |
Maximizing the overlap of two planar convex sets under rigid motions |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2005-06-06 |
- |