A polynomial time circle packing algorithm
From MaRDI portal
Publication:686175
DOI10.1016/0012-365X(93)90340-YzbMATH Open0785.52006OpenAlexW2057382776WikidataQ125757310 ScholiaQ125757310MaRDI QIDQ686175FDOQ686175
Publication date: 11 April 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90340-y
Analysis of algorithms and problem complexity (68Q25) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variational principle for circle packings.
- ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE
- How to Draw a Graph
- ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES
- Empilements de cercles: Convergence d’une méthode de point fixe
- A Note on Planar Graphs and Circle Orders
Cited In (17)
- A variational principle for circle packings.
- Title not available (Why is that?)
- Circle Packing: Experiments In Discrete Analytic Function Theory
- Variational principles for circle patterns and Koebe’s theorem
- Pointed drawings of planar graphs
- On intersection representations of co-planar graphs
- Existence and hardness of conveyor belts
- Conformal mapping in linear time
- Convex representations of maps on the torus and other flat surfaces
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
- Packing disks by flipping and flowing
- A circle packing algorithm
- A linearized circle packing algorithm
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- The partial visibility representation extension problem
- PERM for solving circle packing problem
Recommendations
This page was built for publication: A polynomial time circle packing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686175)
