中文
相关论文

相关论文: Unfolding Smooth Prismatoids

200 篇论文

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

计算几何 · 计算机科学 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…

度量几何 · 数学 2017-03-17 Felix Günther , Caigui Jiang , Helmut Pottmann

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

计算几何 · 计算机科学 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…

计算几何 · 计算机科学 2025-07-15 Mirela Damian , Henk Meijer

Some generalizations and variations of the Fintushel-Stern rim surgery are known to produce smoothly knotted surfaces. We show that if the fundamental groups of their complements are cyclic, then these surfaces are topologically unknotted.…

几何拓扑 · 数学 2008-10-21 Hee Jung Kim , Daniel Ruberman

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…

计算几何 · 计算机科学 2016-08-01 Joseph O'Rourke

The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron…

计算几何 · 计算机科学 2021-01-07 Joseph O'Rourke

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

计算几何 · 计算机科学 2021-11-03 Satyan L. Devadoss , Matthew Harvey

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

度量几何 · 数学 2014-03-12 István Kovács , Géza Tóth

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

计算几何 · 计算机科学 2015-03-13 István Kovács

This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…

几何拓扑 · 数学 2025-11-14 Joel Hass

In this paper, we prove that for any smooth hypersurface $Y$ of degree $d$ in $\mathbb{P}^{n+1}_k$, the cyclic $d$-fold cover $\widetilde{Y} \to \mathbb{P}^{n+1}_k$ branched along $Y$ completely characterizes $Y$ up to projective…

代数几何 · 数学 2025-10-28 Zhiyuan Li , Zhichao Tang

We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the…

组合数学 · 数学 2020-07-28 Kristin DeSplinter , Satyan L. Devadoss , Jordan Readyhough , Bryce Wimberly

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfolding strictly and implement a program that derives the…

计算几何 · 计算机科学 2026-04-20 Takashi Yoshino , Supanut Chaidee

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

度量几何 · 数学 2026-03-10 Steven Hoehner

The purpose of this article is to investigate the relationship between suborbifolds and orbifold embeddings. In particular, we give natural definitions of the notion of suborbifold and orbifold embedding and provide many examples.…

微分几何 · 数学 2015-11-25 Joseph E. Borzellino , Victor Brunsden

We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1…

计算几何 · 计算机科学 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

计算几何 · 计算机科学 2011-12-21 Mirela Damian , Erik Demaine , Robin Flatland

This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.

微分几何 · 数学 2014-08-05 Igor Belegradek

We prove that, both in the hyperbolic and spherical 3-spaces, there exist nonconvex compact boundary-free polyhedral surfaces without selfintersections which admit nontrivial continuous deformations preserving all dihedral angles and study…

度量几何 · 数学 2014-09-10 Victor Alexandrov