There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 44 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 27 | - |
dc.citation.title | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | - |
dc.citation.volume | 22 | - |
dc.contributor.author | Ahn, Hee-Kap | - |
dc.contributor.author | Knauer, Christian | - |
dc.contributor.author | Scherfenberg, Marc | - |
dc.contributor.author | Schlipf, Lena | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-22T05:18:50Z | - |
dc.date.available | 2023-12-22T05:18:50Z | - |
dc.date.created | 2016-06-18 | - |
dc.date.issued | 2012-02 | - |
dc.description.abstract | We consider the problem of computing the discrete Frechet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2(O(d2))m(2)n(2)log(2)(mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the planar case with running time O(mn log(3)(mn) + (m(2)+n(2)) log(mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L-infinity distance, we give an O(dmn log(dmn))-time algorithm. We also give efficient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in "realistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size) | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.22, no.1, pp.27 - 44 | - |
dc.identifier.doi | 10.1142/S0218195912600023 | - |
dc.identifier.issn | 0218-1959 | - |
dc.identifier.scopusid | 2-s2.0-84866274868 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19939 | - |
dc.identifier.url | http://www.worldscientific.com/doi/abs/10.1142/S0218195912600023 | - |
dc.identifier.wosid | 000308707000003 | - |
dc.language | 영어 | - |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.title | COMPUTING THE DISCRETE FRECHET DISTANCE WITH IMPRECISE INPUT | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Shape matching | - |
dc.subject.keywordAuthor | Frechet distance | - |
dc.subject.keywordAuthor | imprecise input | - |
dc.subject.keywordPlus | GEOMETRIC OPTIMIZATION | - |
dc.subject.keywordPlus | CURVES | - |
dc.subject.keywordPlus | POINTS | - |
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.