Optimal Möbius Transformations for Information Visualization and Meshing

We give linear-time quasiconvex programming algorithms for finding a Mobius 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.

[1]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[2]  Tobin A. Driscoll,et al.  Numerical Conformal Mapping Using Cross-Ratios and Delaunay Triangulation , 1998, SIAM J. Sci. Comput..

[3]  Tamara Munzner,et al.  Visualizing the structure of the World Wide Web in 3D hyperbolic space , 1995, VRML '95.

[4]  Marshall W. Bern,et al.  Mesh Generation , 2020, Handbook of Computational Geometry.

[5]  Kenneth Stephenson,et al.  A circle packing algorithm , 2003, Comput. Geom..

[6]  David Eppstein,et al.  Algorithms for Proximity Problems in Higher Dimensions , 1995, Comput. Geom..

[7]  David Eppstein,et al.  Optimal point placement for mesh smoothing , 1997, SODA '97.

[8]  Kenneth L. Clarkson,et al.  A Las Vegas algorithm for linear programming when the dimension is small , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  David Eppstein.  Setting Parameters by Example , 2003, SIAM J. Comput..

[10]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[11]  Bernd Gärtner,et al.  Exact Primitives for Smallest Enclosing Ellipses , 1998, Inf. Process. Lett..

[12]  L. Trefethen.  Numerical computation of the Schwarz-Christoffel transformation , 1979 .

[13]  L. Trefethen,et al.  Computation of conformal maps by modified schwarz-christoffel transformations , 1990 .

[14]  W. Floyd,et al.  HYPERBOLIC GEOMETRY , 1996 .

[15]  Arno Formella,et al.  Generalized Fisheye Views of Graphs , 1995, Graph Drawing.

[16]  Martin E. Dyer,et al.  A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..

[17]  Ron Shamir,et al.  A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio , 1993, Math. Program..

[18]  David A. Rottenberg,et al.  Quasi-Conformally Flat Mapping the Human Cerebellum , 1999, MICCAI.

[19]  Joe F. Thompson,et al.  Numerical grid generation: Foundations and applications , 1985 .

[20]  Frank Stenger,et al.  Conformal maps via Sine methods , 1999 .

[21]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[22]  Jon Louis Bentley,et al.  The Complexity of Finding Fixed-Radius Near Neighbors , 1977, Inf. Process. Lett..

[23]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1992, FOCS.

[24]  Bernd Gärtner,et al.  Exact primitives for smallest enclosing ellipses , 1997, SCG '97.

[25]  Bojan Mohar,et al.  A polynomial time circle packing algorithm , 1993, Discret. Math..

[26]  Graham R. Brightwell,et al.  Representations of Planar Graphs , 1993, SIAM J. Discret. Math..

[27]  David G. Kirkpatrick,et al.  On the Complexity of Recognizing Intersection and Touching Graphs of Disks , 1995, GD.

[28]  Jean-Daniel Boissonnat,et al.  Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes , 1996, Int. J. Comput. Geom. Appl..

[29]  Warren D. Smith.  Accurate circle con?gurations and numerical conformal mapping in polynomial time , 1991 .

[30]  Tamara Munzner,et al.  Exploring Large Graphs in 3D Hyperbolic Space , 1998, IEEE Computer Graphics and Applications.

[31]  Nina Amenta,et al.  Helly-type theorems and Generalized Linear Programming , 1994, Discret. Comput. Geom..

[32]  Horst Sachs,et al.  Coin graphs, Polyhedra, and conformal mapping , 1994, Discret. Math..

[33]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1995, SIAM J. Comput..