Related papers: Dihedral Rigidity and Deformation

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

We propose DeepMetaHandles, a 3D conditional generative model based on mesh deformation. Given a collection of 3D meshes of a category and their deformation handles (control points), our method learns a set of meta-handles for each shape,…

Topology and geometry are deeply intertwined in the study of surfaces, though their interaction manifests differently in smooth and discrete settings. In the smooth category, a classical result asserts that any closed smooth surface…

We embark in a program of studying the problem of better approximating surfaces by triangulations(triangular meshes) by considering the approximating triangulations as finite metric spaces and the target smooth surface as their…

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

Existing 3D surface representation approaches are unable to accurately classify pixels and their orientation lying on the boundary of an object. Thus resulting in coarse representations which usually require post-processing steps to extract…

Symmetric varieties are normal equivariant open embeddings of symmetric homogeneous spaces and they are interesting examples of spherical varieties. The principal goal of this article is to study the rigidity under K\"{a}hler deformations…

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

Mesh repair is a long-standing challenge in computer graphics and related fields. Converting defective meshes into watertight manifold meshes can greatly benefit downstream applications such as geometric processing, simulation, fabrication,…

We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).

Deformable shape modeling approaches that describe objects in terms of their medial axis geometry (e.g., m-reps [Pizer et al., 2003]) yield rich geometrical features that can be useful for analyzing the shape of sheet-like biological…

Let $g \colon S \looparrowright N$ be a properly immersed $\pi_1$--injective surface in a non-geometric $3$--manifold $N$. We compute the distortion of $\pi_1(S)$ in $\pi_1(N)$ and show that how it is related to separability of $\pi_1(S)$…

Discrete flow mapping was recently introduced as an efficient ray based method determining wave energy distributions in complex built up structures. Wave energy densities are transported along ray trajectories through polygonal mesh…

Machine learning has been progressively generalised to operate within non-Euclidean domains, but geometrically accurate methods for learning on surfaces are still falling behind. The lack of closed-form Riemannian operators, the…

Let $M$ be a complete, connected Riemannian surface and suppose that $\mathcal{S} \subset M$ is a discrete subset. What can we learn about $M$ from the knowledge of all distances in the surface between pairs of points of $\mathcal{S}$? We…

An example of reversible (or hinge inside-out transformable) figures is the Dudeney's Haberdasher's puzzle in which an equilateral triangle is dissected into four pieces, then hinged like a chain, and then is transformed into a square by…

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…