Computing the Fréchet distance between real-valued surfaces

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
89 Downloads (Pure)


The Fréchet distance is a well-studied measure for the similarity of shapes. While efficient algorithms for computing the Fréchet distance between curves exist, there are only few results on the Fréchet distance between surfaces. Recent work has shown that the Fréchet distance is computable between piecewise linear functions f and g : M → Rk with M a triangulated surface of genus zero. We focus on the case k = 1 and M being a topological sphere or disk with constant boundary. Intuitively, we measure the distance between terrains based solely on the height function. Our main result is that in this case computing the Fréchet distance between f and g is in NP. We additionally show that already for k = 1, computing a factor 2 - ϵ approximation of the Fréchet distance is NP-hard, showing that this problem is in fact NP-complete. We also define an intermediate distance, between contour trees, which we also show to be NP-complete to compute. Finally, we discuss how our and other distance measures between contour trees relate to each other.

Originele taal-2Engels
TitelProc. 28th Annual Symposium on Discrete Algorithms (SODA)
RedacteurenP.N. Klein
Plaats van productiePhiladelphia
UitgeverijAssociation for Computing Machinery, Inc
Aantal pagina's13
ISBN van elektronische versie978-1-61197-478-2
StatusGepubliceerd - 2017
Evenement28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) - Barcelona, Spanje
Duur: 16 jan 201719 jan 2017
Congresnummer: 28


Congres28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017)
Verkorte titelSODA 2017

Vingerafdruk Duik in de onderzoeksthema's van 'Computing the Fréchet distance between real-valued surfaces'. Samen vormen ze een unieke vingerafdruk.

Citeer dit