Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorYoon, Sang Dukko
dc.contributor.authorKim, Min-Gyuko
dc.contributor.authorSon, Wanbinko
dc.contributor.authorAhn, Hee-Kapko
dc.date.accessioned2018-10-22T07:57:10Z-
dc.date.available2018-10-22T07:57:10Z-
dc.date.created2018-04-23-
dc.date.issued2018-03-
dc.identifier.citationTHEORETICAL COMPUTER SCIENCE, v.715, pp.60 - 70-
dc.identifier.issn0304-3975-
dc.identifier.urihttp://oasis.postech.ac.kr/handle/2014.oak/93998-
dc.description.abstractWe consider a geometric matching of two realistic terrains, each of which is modeled as a piecewise-linear bivariate function. For two realistic terrains f and g where the domain of g is relatively larger than that of f, we seek to find a translated copy f' of f such that the domain of f' is a sub-domain of g and the L-infinity or the L-1 distance of f' and g restricted to the domain of f' is minimized. In this paper, we show a tight bound on the number of different combinatorial structures that f and g can have under translation in their projections on the xy-plane. We give a deterministic algorithm and a randomized one that compute an optimal translation of f with respect to g under L-infinity metric. We also give a deterministic algorithm that computes an optimal translation of f with respect to g under L-1 metric. (C) 2018 Elsevier B.V. All rights reserved.-
dc.description.abstractWe consider a geometric matching of two realistic terrains, each of which is modeled as a piecewise-linear bivariate function. For two realistic terrains f and g where the domain of g is relatively larger than that of f, we seek to find a translated copy f' of f such that the domain of f' is a sub-domain of g and the L-infinity or the L-1 distance of f' and g restricted to the domain of f' is minimized. In this paper, we show a tight bound on the number of different combinatorial structures that f and g can have under translation in their projections on the xy-plane. We give a deterministic algorithm and a randomized one that compute an optimal translation of f with respect to g under L-infinity metric. We also give a deterministic algorithm that computes an optimal translation of f with respect to g under L-1 metric. (C) 2018 Elsevier B.V. All rights reserved.-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.subjectPiecewise linear techniques-
dc.subjectBivariate functions-
dc.subjectCombinatorial structures-
dc.subjectDeterministic algorithms-
dc.subjectGeometric matching-
dc.subjectPiecewise linear-
dc.subjectRealistic terrains-
dc.subjectSub-domains-
dc.subjectTight bound-
dc.subjectGeometry-
dc.titleGeometric matching algorithms for two realistic terrains-
dc.typeArticle-
dc.identifier.doi10.1016/j.tcs.2018.01.011-
dc.type.rimsART-
dc.contributor.localauthorAhn, Hee-Kap-
dc.contributor.nonIdAuthorKim, Min-Gyu-
dc.contributor.nonIdAuthorSon, Wanbin-
dc.identifier.wosid000426222500004-
dc.citation.endPage70-
dc.citation.startPage60-
dc.citation.titleTHEORETICAL COMPUTER SCIENCE-
dc.citation.volume715-
dc.identifier.scopusid2-s2.0-85040663468-
dc.description.journalClass1-
dc.description.wostc0-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

 AHN, HEE KAP
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse