English
Related papers

Related papers: Filling a Hole in a Crease Pattern: Isometric Mapp…

200 papers

Seamless global parametrization of surfaces is a key operation in geometry processing, e.g. for high-quality quad mesh generation. A common approach is to prescribe the parametric domain structure, in particular the locations of…

Graphics · Computer Science 2021-04-13 Marcel Campen , Hanxiao Shen , Jiaran Zhou , Denis Zorin

When finding an original proof to a known result describing expansive mappings on compact metric spaces as surjective isometries, we reveal that relaxing the condition of compactness to total boundedness preserves the isometry property and…

Functional Analysis · Mathematics 2019-10-24 Marat V. Markin , Edward S. Sichel

Gromov conjectured that the total mean curvature of the boundary of a compact Riemannian manifold can be estimated from above by a constant depending only on the boundary metric and on a lower bound for the scalar curvature of the fill-in.…

Differential Geometry · Mathematics 2026-02-10 Christian Baer

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

We prove that an open manifold with nonnegative Ricci curvature, linear volume growth and noncollapsed ends always splits off a line at infinity. This completes the final step to prove the existence of isoperimetric sets given large volumes…

Differential Geometry · Mathematics 2024-06-11 Xingyu Zhu

We study the deformation of a liquid interface with arbitrary principal curvatures by a flat circular sheet. Working first at small slopes, we determine the shape of the sheet analytically in the membrane limit, where the sheet is…

Soft Condensed Matter · Physics 2025-06-03 Zachariah S. Schrecengost , Seif Hejazine , Jordan V. Barrett , Vincent Démery , Joseph D. Paulsen

A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…

Computational Geometry · Computer Science 2017-05-09 Radoslav Fulek

A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn…

Computational Geometry · Computer Science 2023-06-22 Rodrigo I. Silveira , Bettina Speckmann , Kevin Verbeek

The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…

Disordered Systems and Neural Networks · Physics 2025-05-13 Kyungeun Kim , Christian D. Santangelo

In this paper we prove that the problem of deciding contractibility of an arbitrary closed curve on the boundary of a 3-manifold is in NP. We emphasize that the manifold and the curve are both inputs to the problem. Moreover, our algorithm…

Computational Geometry · Computer Science 2020-12-07 Erin Wolf Chambers , Francis Lazarus , Arnaud de Mesmay , Salman Parsa

A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…

Computational Physics · Physics 2011-05-09 Ian H Hutchinson

In this article, we compute the topological expansion of all possible mixed-traces in a hermitian two matrix model. In other words we give a recipe to compute the number of discrete surfaces of given genus, carrying an Ising model, and with…

High Energy Physics - Theory · Physics 2009-11-13 Bertrand Eynard , Nicolas Orantin

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computational Geometry · Computer Science 2020-10-09 Stanislaw Ambroszkiewicz

We investigate the crumpling of a sheet as it is repeatedly crushed onto itself by rolling it into a cylinder and twisting it axially while allowing the end-to-end length to evolve freely. As deduced from its plastic deformations, the sheet…

Soft Condensed Matter · Physics 2025-01-22 Amit Dawadi , Arshad Kudrolli

We show that two properly embedded compact surfaces in an orientable 4-manifold are cobordant if and only if they are $\mathbb{Z}/2$-homologous and either the 4-manifold has boundary or the surfaces have the same normal Euler number. If the…

Geometric Topology · Mathematics 2026-01-30 Simeon Hellsten

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

Computational Geometry · Computer Science 2025-09-05 Mikkel Abrahamsen , Jack Stade , Shuyi Yan , Hanwen Zhang

We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…

Computational Geometry · Computer Science 2019-04-12 Di Qiu , Ka-Chun Lam , Lok-Ming Lui

We develop a compactness result near the boundary for families of locally convex immersions. We also develop a mod 2 degree theory for immersion of constant (and prescribed) Gaussian curvature with prescribed boundary. These are then used…

Differential Geometry · Mathematics 2011-03-17 Graham Smith

It is possible to construct distinct polyfolds which model a given moduli space problem in subtly different ways. These distinct polyfolds yield invariants which, a priori, we cannot assume are equivalent. We provide a general framework for…

Symplectic Geometry · Mathematics 2020-01-01 Wolfgang Schmaltz

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

Computational Geometry · Computer Science 2009-08-13 Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov