arXiv subjects

Klara Mundilova

Publications and source records attributed to Klara Mundilova.

5 recordsLinked to original sources

arXiv2026

On the Rigid-Ruling Folding of Curved Creases: Conjugate-Net Preserving Isometric Deformations of Semi-Discrete Globally Developable Conjugate-Nets

In this paper, we investigate rigid-ruling folding motions of crease-rule patterns, that is, conjugacy-preserving isometries of developable semi-discrete conjugate nets. We derive two conditions for the rigid-ruling foldability of pairs of curves and consider two applications. First, we introduce computations that enable the sequential construction of rigid-ruling foldable crease-rule patterns. Second, we examine combinations of planar and constant fold-angle creases. In particular, we show that constant fold-angle creases are only compatible with other constant fold-angle creases, and we provide a characterization of rigid-ruling foldable combinations of planar and constant fold-angle creases.

math.DG↗

arXiv2026

(Semi-)Invariant Curves from Centers of Triangle Families

We study curves obtained by tracing triangle centers within special families of triangles, focusing on centers and families that yield (semi-)invariant triangle curves, meaning that varying the initial triangle changes the loci only by an affine transformation. We identify four two-parameter families of triangle centers that are semi-invariant and determine which are invariant, in the sense that the resulting curves for different initial triangles are related by a similarity transformation. We further observe that these centers, when combined with the aliquot triangle family, yield sheared Maclaurin trisectrices, whereas the nedian triangle family yields Limaçon trisectrices.

math.MG↗

arXiv2025

Quasigeodesics on the Cube

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le π$ surface to each side at every point. In contrast, a geodesic has exactly $π$ to each side and so can never pass through a vertex, whereas quasigeodesics can. Although it is known that every convex polyhedron has at least three simple closed quasigeodesics, little else is known. Only tetrahedra have been thoroughly studied. In this paper we explore the quasigeodesics on a cube, which have not been previously enumerated. We prove that the cube has exactly $15$ simple closed quasigeodesics (beyond the three known simple closed geodesics). For the lower bound we detail $15$ simple closed quasigeodesics. Our main contribution is establishing a matching upper bound. For general convex polyhedra, there is no known upper bound.

math.MG↗

arXiv2024

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many fascinating and challenging associated problems. Hex meshes vary in complexity from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges are adjacent to exactly four hexes. Edges not satisfying this criteria are considered singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. While all hex meshes with singularities are unstructured, those with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. With this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

cs.CG↗

arXiv2020

Folding Polyominoes with Holes into a Cube

When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special \emph{simple} holes guarantee foldability.

cs.CG↗