Related papers: An algebraic approach to circle packing

It is shown that the complex Bernoulli differential equations admitting the supplementary structure of a Lie-Hamilton system related to the book algebra $\mathfrak{b}_2$ can always be solved by quadratures, providing an explicit solution of…

Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity…

We determine the symmetrized topological complexity of the circle, using primarily just general topology.

The Descartes circle theorem states that if four circles are mutually tangent with disjoint intersion, then their curvatures (or "bends) b_j = 1/r_j satisfy the relation (b_1 + b_2 + b_3 + b_4)^2 = 2(b_1^2 + b_2^2 + b_3^2 + b_4^2). We show…

We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these methods can generate meshes of several types: (1) the elements…

We study the theory of equations in one variable over polyhedral semirings. The article revolves around a notion of solution to a polynomial equation over a polyhedral semiring. Our main results are a characterisation of local solutions in…

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

Principal circle bundle over a PL polyhedron can be triangulated and thus obtains combinatorics. The triangulation is assembled from triangulated circle bundles over simplices. To every triangulated circle bundle over a simplex we associate…

We give a brief introduction to some of the recent works on finding geometric structures on triangulated surfaces using variational principles.

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

One method for obtaining every closed orientable 3-manifold is as branched covering of the 3-sphere over a link. There is a classical topological result showing that the minimun possible number of sheets in the covering is three. In this…

We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of the…

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as…

A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…

This paper investigates several global rigidity issues for polyhedral surfaces including inversive distance circle packings. Inversive distance circle packings are polyhedral surfaces introduced by P. Bowers and K. Stephenson as a…

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

There are three complete plane geometries of constant curvature: spherical, Euclidean and hyperbolic geometry. We explain how a closed oriented surface can carry a geometry which locally looks like one of these. Focussing on the hyperbolic…

The theorem of three circles in real algebraic geometry guarantees the termination and correctness of an algorithm of isolating real roots of a univariate polynomial. The main idea of its proof is to consider polynomials whose roots belong…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…