A circle packing is a configuration P of circles realizing a specified pattern of tangencies. Radii of packings in the euclidean and hyperbolic planes may be computed using an iterative process suggested by William Thurston. We describe an efficient implementation, discuss its performance, and illustrate recent applications. A central role is played by new and subtle monotonicity results for “flowers ” of circles
International audienceCircle packing can be seen as the art of placing tangent circles on the plane,...
A graph can be represented by various geometric representations. In this work we focus on the circle...
AbstractThe Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. S...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
We present an interactive tool for visualizing and experimenting with different circle packing algor...
International audienceCircle packing can be seen as the art of placing tangent circles on the plane,...
The paper presents a new verified optimization method for the problem of finding the densest packing...
Given a bounded sequence of integers {d0,d1,d2,...}, 6 ≤ dn ≤M, there is an associated abstract tria...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
This paper concerns the approximation of analytic functions using certain configurations of circles ...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
This document contains the supplemental material of our paper, "Circle packing in arbitrary domains"...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
International audienceCircle packing can be seen as the art of placing tangent circles on the plane,...
A graph can be represented by various geometric representations. In this work we focus on the circle...
AbstractThe Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. S...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
AbstractA circle packing is a configuration P of circles realizing a specified pattern of tangencies...
We present an interactive tool for visualizing and experimenting with different circle packing algor...
International audienceCircle packing can be seen as the art of placing tangent circles on the plane,...
The paper presents a new verified optimization method for the problem of finding the densest packing...
Given a bounded sequence of integers {d0,d1,d2,...}, 6 ≤ dn ≤M, there is an associated abstract tria...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
This paper concerns the approximation of analytic functions using certain configurations of circles ...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
This document contains the supplemental material of our paper, "Circle packing in arbitrary domains"...
William Thurston first proposed that real circles could be used to approximate the underlying infini...
International audienceCircle packing can be seen as the art of placing tangent circles on the plane,...
A graph can be represented by various geometric representations. In this work we focus on the circle...
AbstractThe Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. S...
DOI
Add to ORKG