A linearized circle packing algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 2182144 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- A circle packing algorithm
- A polynomial time circle packing algorithm
- A probabilistic proof of Thurston's conjecture on circle packings
- A “regular” pentagonal tiling of the plane
- Circle packings as differentiable manifolds
- Circle packings of maps in polynomial time
- Circle patterns with the combinatorics of the square grid
- Computing Discrete Minimal Surfaces and Their Conjugates
- Conformal tilings. I: Foundations, theory, and practice
- Curvature flow in conformal mapping
- Empilements de cercles: Convergence d’une méthode de point fixe
- Finite subdivision rules
- How to Draw a Graph
- Limit shapes and the complex Burgers equation
- Liouville quantum gravity and KPZ
- On Beurling's boundary value problem in circle packing
- On the Riemann surface type of random planar maps
- Quantum gravity and inventory accumulation
- Recurrence of planar graph limits
- Recurrent random walks, Liouville's theorem and circle packings
- The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings
- The convergence of circle packings to the Riemann mapping
- Uniformizing dessins and Belyĭ maps via circle packing
- Variational principles for circle patterns and Koebe’s theorem
This page was built for publication: A linearized circle packing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398821)