Related papers: Quadrilateral Meshing by Circle Packing
Quadrilaterals in the complex plane play a significant part in the theory of planar quasiconformal mappings. Motivated by the geometric definition of quasiconformality, we prove that every quadrilateral with modulus in an interval $[1/K,…
It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…
A procedure that generates parallelograms from any quadrilateral is presented. If the original quadrilateral is itself a parallelogram, then the procedure gives squares. Hence, when applied two times, this procedure generates squares from…
We describe procedures for generating all 2-cell embedded simple graphs with up to a fixed number of vertices on a given surface. We also modify these procedures to generate closed 2-cell embeddings and polyhedral embeddings. We give…
Let $S$ be a set of $n$ points in the unit square $[0,1]^2$, one of which is the origin. We construct $n$ pairwise interior-disjoint axis-aligned empty rectangles such that the lower left corner of each rectangle is a point in $S$, and the…
We introduce a general procedure called `reverse engineering' that can be used to construct infinite families of smooth 4-manifolds in a given homeomorphism type. As one of the applications of this technique, we produce an infinite family…
A continuum description of unstructured meshes in two dimensions, both for planar and curved surface domains, is proposed. The meshes described are those which, in the limit of an increasingly finer mesh (smaller cells), and away from…
The diagonals of a quadrilateral form four associated triangles, called half triangles. Each half triangle is bounded by two sides of the quadrilateral and one diagonal. If we locate a triangle center (such as the incenter, centroid,…
It is shown that one can count $k$-edge paths in an $n$-vertex graph and $m$-set $k$-packings on an $n$-element universe, respectively, in time ${n \choose k/2}$ and ${n \choose mk/2}$, up to a factor polynomial in $n$, $k$, and $m$; in…
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
Some error analysis on virtual element methods including inverse inequalities, norm equivalence, and interpolation error estimates are presented for polygonal meshes which admits a virtual quasi-uniform triangulation.
In the present paper we introduce a Virtual Element Method (VEM) for the approximate solution of general linear second order elliptic problems in mixed form, allowing for variable coefficients. We derive a theoretical convergence analysis…
We have carried out a quantitative analysis of the chain packing in polymeric melts using molecular dynamics simulations. The analysis involves constructing Voronoi tessellations in the equilibrated configurations of the polymeric melts. In…
Suppose that $I$ is a unit square. Let $T$ (resp. $\Delta$) be an isosceles right triangle (resp. an equilateral triangle). We prove that any collection of triangles homothetic to $T$ (resp. $\Delta$), whose total area does not exceed…
We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We…
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
Quadrilateral meshes with high level structure and feature preserving property benefit industrial applications the most. Generation of such quad mesh remains a challenge. Quad meshes generated using surface foliation have the highest level…
This article describes, in elementary terms, a generic approach to produce discrete random tilings and similar random structures by using point process theory. The standard Voronoi and Delone tilings can be constructed in this way. For this…