Pages that link to "Item:Q686175"
From MaRDI portal
The following pages link to A polynomial time circle packing algorithm (Q686175):
Displaying 14 items.
- Pointed drawings of planar graphs (Q452448) (← links)
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing (Q471143) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Convex representations of maps on the torus and other flat surfaces (Q1314444) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- A circle packing algorithm (Q1873691) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- A linearized circle packing algorithm (Q2398821) (← links)
- Packing disks by flipping and flowing (Q2665260) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Variational principles for circle patterns and Koebe’s theorem (Q4433112) (← links)
- Circle Packing: Experiments In Discrete Analytic Function Theory (Q4891324) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
