There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 15 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 3 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 37 | - |
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-22T09:14:53Z | - |
dc.date.available | 2023-12-22T09:14:53Z | - |
dc.date.created | 2016-06-18 | - |
dc.date.issued | 2007-05 | - |
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 epsilon > 0, we compute a rigid motion such that the area of overlap is at least 1-epsilon times the maximum possible overlap. Our algorithm uses O(1/epsilon) extreme point and line intersection queries on P and Q, plus O((1/epsilon(2)) log(1/epsilon)) running time. If only translations are allowed, the extra running time reduces to O((1/epsilon) log(1/epsilon)). If P and Q are convex polygons with n vertices in total that are given in an array or balanced tree, the total running time is O((1/epsilon) log n + (1/epsilon(2)) log(1/epsilon)) for rigid motions and O((1/epsilon) log n + (1/epsilon) log(1/epsilon)) for translations. (c) 2006 Elsevier B.V. All rights reserved | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.37, no.1, pp.3 - 15 | - |
dc.identifier.doi | 10.1016/j.comgeo.2006.01.005 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.scopusid | 2-s2.0-33847121346 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19951 | - |
dc.identifier.url | http://www.sciencedirect.com/science/article/pii/S0925772106000678 | - |
dc.identifier.wosid | 000245339400002 | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Maximizing the overlap of two planar convex sets under rigid motions | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | approximation algorithm | - |
dc.subject.keywordAuthor | sublinear algorithm | - |
dc.subject.keywordAuthor | convex shape | - |
dc.subject.keywordAuthor | geometric pattern matching | - |
dc.subject.keywordPlus | POLYGONS | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordPlus | AREA | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.