Related papers: Reshaping Convex Polyhedra
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces…
Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an $O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and has cutting cost $O((\log n)^2)$ times the optimal.
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
We introduce a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface. Our approach is particularly tolerant to defects in the input, which is allowed to self-intersect, to be…
We give sufficient conditions for some underdetermined elliptic PDE of any order to construct smooth compactly supported solutions. In particular we show that two smooth elements in the kernel of certain underdetermined linear elliptic…
In this paper, we derive uniqueness and stability results for surface tensors. Further, we develop two algorithms that reconstruct shape of $n$-dimensional convex bodies. One algorithm requires knowledge of a finite number of surface…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…
A polyomino is a polygonal region with axis parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling and packing problems with polyomino pieces and a polyomino container $P$. We give…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
On a convex polyhedron P, the cut locus C(x) with respect to a point x is a tree of geodesic segments (shortest paths) on P that includes every vertex. We say that P has a skeletal cut locus if there is some x in P such that C(x) subset…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…
For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…
Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…
Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…