arXiv:math/9801088math.GT
Shapes of polyhedra and triangulations of the sphere
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
The space of shapes of a polyhedron with given total angles less than 2πat each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take place a finite distance from a nonsingular point. The metric completion is a complex hyperbolic cone-manifold. In some interesting special cases, the metric completion is an orbifold. The concrete description of these spaces of shapes gives information about the combinatorial classification of triangulations of the sphere with no more than 6 triangles at a vertex.
there are some nice fast computations of Julia sets in Python https://www.ibm.com/developerworks/community/blogs/jfp/entry... however one problem is always requires computing all the backwards iterates of the points. And there's never getting around that. these two ladies offer…
mrcactu5View on HNParent context