Adiabatic Isometric Mapping Algorithm for Embedding 2-Surfaces in Euclidean 3-Space
arXiv:1503.07556 · doi:10.1088/0264-9381/32/23/235012
Abstract
Alexandrov proved that any simplicial complex homeomorphic to a sphere with strictly non-negative Gaussian curvature at each vertex can be isometrically embedded uniquely in as a convex polyhedron. Due to the nonconstructive nature of his proof, there have yet to be any algorithms, that we know of, that realizes the Alexandrov embedding in polynomial time. Following his proof, we developed the adiabatic isometric mapping (AIM) algorithm. AIM uses a guided adiabatic pull-back procedure to produce "smooth" embeddings. Tests of AIM applied to two different polyhedral metrics suggests that its run time is sub cubic with respect to the number of vertices. Although Alexandrov's theorem specifically addresses the embedding of convex polyhedral metrics, we tested AIM on a broader class of polyhedral metrics that included regions of negative Gaussian curvature. One test was on a surface just outside the ergosphere of a Kerr black hole.
arXiv commentThis version has updated figures and corrected typos
References in corpus (6)
- Quasilocal Energy and Conserved Charges Derived from the Gravitational Action
- Quasilocal mass in general relativity
- The Hilbert Action in Regge Calculus
- Simplicial Ricci Flow
- Isometric embeddings of black hole horizons in three-dimensional flat space
- Distributed mean curvature on a discrete manifold for Regge calculus