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

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 in the bit-model of real computation. An analogous result in the real RAM model for piecewise-linear surfaces has recently been obtained by Nayyeri and Xu (2016).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/06/2017

The Fréchet distance of surfaces is computable

We show that the Fréchet distance of two-dimensional parametrised surfac...
research
09/17/2016

Hermite interpolation by piecewise polynomial surfaces with polynomial area element

This paper is devoted to the construction of polynomial 2-surfaces which...
research
10/12/2018

Reconstruction of surfaces with ordinary singularities from their silhouettes

We present algorithms for reconstructing, up to unavoidable projective a...
research
03/01/2018

Codes from surfaces with small Picard number

Extending work of M. Zarzar, we evaluate the potential of Goppa-type eva...
research
08/02/2020

Decision problems for linear recurrences involving arbitrary real numbers

We study the decidability of the Skolem Problem, the Positivity Problem,...
research
02/07/2018

"How to squash a mathematical tomato", Rubic's cube-like surfaces and their connection to reversible computation

Here we show how reversible computation processes, like Margolus diffusi...
research
12/01/2020

Farthest sampling segmentation of triangulated surfaces

In this paper we introduce Farthest Sampling Segmentation (FSS), a new m...

Please sign up or login with your details

Forgot password? Click here to reset