• Corpus ID: 4521897

Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization

@article{Park2017ComputableOO,
  title={Computable Operations on Compact Subsets of Metric Spaces with Applications to Fr{\'e}chet Distance and Shape Optimization},
  author={Chan-Bong Park and Ji-won Park and Sewon Park and Dongseong Seon and Martin Ziegler},
  journal={ArXiv},
  year={2017},
  volume={abs/1701.08402}
}
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types, such as the compact 'hyper' spaces of (i) nonempty closed subsets of $X$ w.r.t. Hausdorff metric, and of (ii) equicontinuous functions on $X$. The thus obtained Cartesian closure is shown to exhibit the same structural properties as in the Euclidean case… 

Figures from this paper

Effective local compactness and the hyperspace of located sets
TLDR
It is shown that effective local compactness suffices to ensure that the hyperspace of closed-and-overt sets (aka located sets, aka closed sets with full information) is computably compact and computably metrizable.
On the computability of the Fr\'echet distance of surfaces in the bit-model of real computation.
We show that the Fr\'echet 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
The Fréchet distance of surfaces is computable
We show that the Fr\'echet distance of two-dimensional parametrised surfaces in a metric space is computable. This settles a long-standing open question in computational geometry.
Continuous Team Semantics
TLDR
It is shown how to define approximate versions of the usual independence/dependence atoms for restricted classes of formulae, and it is shown that one can assume w.l.o.g. that teams are closed sets to import techniques from computable analysis to study the complexity of formula satisfaction and model checking.
Theory and Applications of Models of Computation
  • P. Arno
  • Engineering
    Lecture Notes in Computer Science
  • 2019
TLDR
This paper looks at ways of scheduling workloads over the multiplexed batteries to maximize the overall efficiency and considers two ways to model the efficiency and give efficient solutions to the same.

References

SHOWING 1-10 OF 47 REFERENCES
Computability on subsets of metric spaces
Complexity Theory of (Functions on) Compact Metric Spaces
TLDR
The main results relate Kolmogorov’s entropy of a compact metric space X polynomially to the uniform relativized complexity of approximating various families of continuous functions on X, and offer some guidance towards suitable notions of complexity for higher types.
Algorithmic solution of higher type equations
TLDR
If x is unique and X and Y are subspaces of Kleene– Kreisel spaces of continuous functionals with X exhaustible, then x is computable uniformly in f, y and the exhaustibility condition, and it is shown that it is semi-decidable whether a function defined on such a compact set fails to be analytic.
On the topological aspects of the theory of represented spaces
TLDR
This work presents an abstract and very succinct introduction to the theory of represented spaces, drawing heavily on prior work by Escardo, Schroder, and others.
Can We Compute the Similarity between Surfaces?
TLDR
It follows that the decision problem, whether the Fréchet distance of two given surfaces lies below a specified value, is recursively enumerable, and it is shown that a relaxed version of the FrÉchet distance, the weak Fréchechet distance can be computed in polynomial time.
Effective Hausdorff Dimension in General Metric Spaces
  • E. Mayordomo
  • Mathematics, Computer Science
    Theory of Computing Systems
  • 2018
TLDR
The concept of constructive dimension and its characterization in terms of Kolmogorov complexity is presented, for which it is extended to any metric space defining the Kolmogsorv complexity of a point at a certain precision.
On the completeness of a certain metric space with an application to Blaschke’s selection theorem
2. Preliminaries. Let K be a metric space with elements x, y, • • • and distance function d(x, y). A sequence xi, x2, • • • in K such that ^2T^(Xiy Xi+i) converges has been called an absolutely
Fréchet Distance for Curves, Revisited
TLDR
This work revisits the problem of computing the Frechet distance between polygonal curves, and develops efficient approximation algorithms for K-bounded curves and backbone curves, the latter of which are widely used to model molecular structures.
Complexity theory for spaces of integrable functions
TLDR
Quantitative versions of the Arzel\`a-Ascoli and Fr\'echet-Kolmogorov Theorems are presented and used to argue that these representations fulfill a minimality condition.
...
...