arXiv · cs/0101006
Optimal Moebius Transformations for Information Visualization and Meshing
Abstract
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use similar methods to maximize the minimum distance among a set of pairs of input points. We apply these results to vertex separation and symmetry display in spherical graph drawing, viewpoint selection in hyperbolic browsing, element size control in conformal structured mesh generation, and brain flat mapping.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Marshall Bern, David Eppstein. 2001-02-01. Optimal Moebius Transformations for Information Visualization and Meshing. https://searcharxiv.com/abs/cs/0101006
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.