DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yon, J. | ko |
dc.contributor.author | Cheng, S.-W. | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Vigneron, A. | ko |
dc.date.accessioned | 2018-07-24T02:26:10Z | - |
dc.date.available | 2018-07-24T02:26:10Z | - |
dc.date.created | 2018-07-02 | - |
dc.date.created | 2018-07-02 | - |
dc.date.created | 2018-07-02 | - |
dc.date.issued | 2017-09 | - |
dc.identifier.citation | International Journal of Computational Geometry and Applications, v.27, no.3, pp.177 - 185 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.uri | http://hdl.handle.net/10203/244084 | - |
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. © 2017 World Scientific Publishing Company. | - |
dc.language | English | - |
dc.publisher | World Scientific Publishing Co. Pte Ltd | - |
dc.title | Finding Largest Common Point Sets | - |
dc.type | Article | - |
dc.identifier.scopusid | 2-s2.0-85041186196 | - |
dc.type.rims | ART | - |
dc.citation.volume | 27 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 177 | - |
dc.citation.endingpage | 185 | - |
dc.citation.publicationname | International Journal of Computational Geometry and Applications | - |
dc.identifier.doi | 10.1142/S0218195917500029 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Yon, J. | - |
dc.contributor.nonIdAuthor | Cheng, S.-W. | - |
dc.contributor.nonIdAuthor | Vigneron, A. | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | bottleneck distance | - |
dc.subject.keywordAuthor | congruence | - |
dc.subject.keywordAuthor | partial matching | - |
dc.subject.keywordAuthor | Translations | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.