Weighted Distances on a Triangular Grid

Simple item page
dc.contributor.authorNagy, Benedek
dc.date.accessioned2026-02-06T18:16:50Z
dc.date.issued2014
dc.departmentDoğu Akdeniz Üniversitesi
dc.description16th International Workshop on Combinatorial Image Analysis (IWCIA) -- MAY 28-30, 2014 -- Brno Univ Technol, Fac Mech Engn, Brno, CZECH REPUBLIC
dc.description.abstractIn this paper we introduce weighted distances on a triangular grid. Three types of neighborhood relations are used on the grid, and therefore three weights are used to define a distance function. Some properties of the weighted distances, including metrical properties are discussed. We also give algorithms that compute the weighted distance of any point-pair on a triangular grid. Formulae for computing the distance are also given. Therefore the introduced new distance functions are ready for application in image processing and other fields.
dc.identifier.endpage50
dc.identifier.isbn978-3-319-07148-0
dc.identifier.isbn978-3-319-07147-3
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.scopus2-s2.0-84901660841
dc.identifier.scopusqualityQ3
dc.identifier.startpage37
dc.identifier.urihttps://hdl.handle.net/11129/8653
dc.identifier.volume8466
dc.identifier.wosWOS:000343406800005
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofCombinatorial Image Analysis, Iwcia 2014
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectTriangular grid
dc.subjectDigital distances
dc.subjectShortest paths
dc.subjectDigital metrics
dc.subjectWeighted distances
dc.subjectChamfer distances
dc.subjectDistance map
dc.titleWeighted Distances on a Triangular Grid
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu