Related papers: An algebraic approach to circle packing
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
We introduce (co)homology theory for multiple group racks and construct cocycle invariants of compact oriented surfaces in the 3-sphere using their 2-cocycles, where a multiple group rack is a rack consisting of a disjoint union of groups.…
We realize the Apollonian group associated to an integral Apollonian circle packings, and some of its generalizations, as a group of automorphisms of an algebraic surface. Borrowing some results in the theory of orbit counting, we study the…
In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…
This paper presents an efficient approach for the conceptual design of architectural surfaces which are composed of triangular panels. In the free-form design of discrete architectural surfaces, the Gaussian curvature plays an important…
We prove that for any discrete curvature satisfying Gauss-Bonnet formula, there exist a unique up to scaling inversive distance circle packing in the discrete conformal equivalent class, whose polyhedral metric meets the target curvature.…
Packing is a complex phenomenon of prominence in many natural and industrial processes (liquid crystals, granular materials, infiltration, melting, flow, sintering, segregation, sedimentation, compaction, etc.). A variety of computational…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
It has been shown that univalent circle packings filling in the complex plane $\bold C$ are unique up to similarities of $\bold C$. Here we prove that bounded degree branched circle packings properly covering $\bold C$ are uniquely…
We consider circle packings and, more generally, Delaunay circle patterns - arrangements of circles arising from a Delaunay decomposition of a finite set of points - on surfaces equipped with a complex projective structure. Motivated by a…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…
Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. It observed…
This paper constructs polynomial bases that capture the structure of the de Rham complex with boundary conditions in disks and cylinders (both periodic and finite) in a way that respects rotational symmetry. The starting point is explicit…
A general method for establishing results over a commutative complete intersection local ring by passing to differential graded modules over a graded exterior algebra is described. It is used to deduce, in a uniform way, results on the…
This paper investigated the problem of embedding a simple Hamiltonian Cycle with n vertices on n points inside a simple polygon. This problem seeks to embed a straight-line cycle (without bends), which does not intersect either itself or…
This paper proves a deformation circle pattern theorem, which gives a complete description of those circle patterns with interstices in terms of the combinatorial type, the exterior intersections angles and the conformal structures of…
In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then round the solution. In this paper, we explain why the…
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…