Realizing abstract simplicial complexes with specified edge lengths
Geometric Topology
2023-12-12 v1 Computational Geometry
Combinatorics
Abstract
For finite abstract simplicial complex , initial realization in , and desired edge lengths , we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of realizing the lengths . We provide software to verify these conditions by computer and optionally assist in the creation of an initial realization from abstract simplicial data. Applications include proving the existence of a planar embedding of a graph with specified edge lengths or proving the existence of polyhedra (or higher-dimensional polytopes) with specified edge lengths.
Cite
@article{arxiv.2312.05376,
title = {Realizing abstract simplicial complexes with specified edge lengths},
author = {Matthew Ellison},
journal= {arXiv preprint arXiv:2312.05376},
year = {2023}
}
Comments
14 pages, 3 figures