There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 185 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 177 | - |
dc.citation.title | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.citation.volume | 27 | - |
dc.contributor.author | Yon, Juyoung | - |
dc.contributor.author | Cheng, Siu-Wing | - |
dc.contributor.author | Cheong, Otfried | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-21T21:44:11Z | - |
dc.date.available | 2023-12-21T21:44:11Z | - |
dc.date.created | 2018-01-31 | - |
dc.date.issued | 2017-09 | - |
dc.description.abstract | Let P and Q be two discrete point sets in ϵ>0d of sizes m and n, respectively, and let > 0 be a given input threshold. The largest common point set problem (LCP) seeks the largest subsets A ⊆P and B⊆Q such that |A| = |B| and there exists a transformation Φthat makes the bottleneck distance between Φ(A) and B at mostϵ. We present two algorithms that solve a relaxed version of this problem under translations in Rd and under rigid motions in the plane, and that takes an additional input parameter• > 0. Let ℓbe the largest subset size achievable for the given . Our algorithm finds subsets A ⊆P and B ⊆ Q of size |A| = |B|≥ ℓand a transformation Φsuch that the bottleneck distance between Ï•(A) and B is at most (1 + n). For rigid motions in the plane, the running time is O(n2m2/2(n + m)log n). For translations inRd, the running time is O(nm\n(n + m)1.5log n), where κ= 1 for d = 2 and κ= 2d-1 for d ≥ 3. | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.27, no.3, pp.177 - 185 | - |
dc.identifier.doi | 10.1142/S0218195917500029 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.scopusid | 2-s2.0-85041186196 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/23253 | - |
dc.identifier.url | http://www.worldscientific.com/doi/abs/10.1142/S0218195917500029 | - |
dc.language | 영어 | - |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.title | Finding largest common point sets | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | bottleneck distance | - |
dc.subject.keywordAuthor | congruence | - |
dc.subject.keywordAuthor | partial matching | - |
dc.subject.keywordAuthor | Translations | - |
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.