AI Chat

Geodesic complexity of a cube

08/08/2023

∙

by Donald M. Davis, et al.

∙

∙

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic complexity of a cube exceeds its topological complexity by exactly 2. The proof involves a careful analysis of cut loci of the cube.

page 1

page 2

page 3

page 4

∙ 08/19/2019

The Topological Complexity of Spaces of Digital Jordan Curves

This research is motivated by studying image processing algorithms throu...

0 Shelley Kandola, et al. ∙

∙ 09/14/2021

The complexity of sharing a pizza

Assume you have a 2-dimensional pizza with 2n ingredients that you want ...

0 Patrick Schnider, et al. ∙

∙ 10/11/2020

Collision free motion planning on a wedge of circles

We exhibit an algorithm with continuous instructions for two robots movi...

0 Elif Sensoy, et al. ∙

∙ 08/09/2021

Topological Art in Simple Galleries

Let P be a simple polygon, then the art gallery problem is looking for a...

0 Daniel Bertschinger, et al. ∙

∙ 08/14/2018

Complexity of Shift Spaces on Semigroups

Let G=〈 S|R_A〉 be a semigroup with generating set S and equivalences R...

0 J. C. Ban, et al. ∙

∙ 08/20/2010

Towards Stratification Learning through Homology Inference

A topological approach to stratification learning is developed for point...

0 Paul Bendich, et al. ∙

∙ 11/27/2021

Nonparametric Topological Layers in Neural Networks

Various topological techniques and tools have been applied to neural net...

0 Dongfang Zhao, et al. ∙