The Fréchet distance of surfaces is computable

11/06/2017
by   Eike Neumann, et al.
0

We show that the Fréchet distance of two-dimensional parametrised surfaces in a metric space is computable. This settles a long-standing open question in computational geometry.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

On the computability of the Fréchet distance of surfaces in the bit-model of real computation

We show that the Fréchet distance of two-dimensional parametrised surfac...
research
02/12/2021

A Computability Perspective on (Verified) Machine Learning

There is a strong consensus that combining the versatility of machine le...
research
10/25/2018

TiGL - An Open Source Computational Geometry Library for Parametric Aircraft Design

This paper introduces the software TiGL: TiGL is an open source high-fid...
research
03/04/2020

An effective version of definability in metric model theory

In this paper, a computably definable predicate is defined and character...
research
01/29/2001

The Generalized Universal Law of Generalization

It has been argued by Shepard that there is a robust psychological law t...
research
11/20/2001

The similarity metric

A new class of distances appropriate for measuring similarity relations ...
research
01/31/2018

On the computability of graphons

We investigate the relative computability of exchangeable binary relatio...

Please sign up or login with your details

Forgot password? Click here to reset