中文
相关论文

相关论文: Unfolding Orthogonal Terrains

200 篇论文

An invariant of three-dimensional orientable manifolds is built on the base of a solution of pentagon equation expressed in terms of metric characteristics of Euclidean tetrahedra.

几何拓扑 · 数学 2015-06-26 Igor G. Korepanov

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

综合数学 · 数学 2007-05-23 Sergey Nikitin

It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…

数学物理 · 物理学 2015-01-22 Matteo Polettini

A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

组合数学 · 数学 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

Minimal surfaces are ubiquitous in nature. Here they are considered as geometric objects that bear a deformation content. By refining the resolution of the surface deformation gradient afforded by the polar decomposition theorem, we…

微分几何 · 数学 2024-08-13 André M. Sonnet , Epifanio G. Virga

A foundational result in origami mathematics is Kawasaki and Justin's simple, efficient characterization of flat foldability for unassigned single-vertex crease patterns (where each crease can fold mountain or valley) on flat material. This…

计算几何 · 计算机科学 2022-04-11 Lily Chung , Erik D. Demaine , Dylan Hendrickson , Victor Luo

This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…

历史与综述 · 数学 2018-09-18 Jorge C. Lucero

Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…

经典分析与常微分方程 · 数学 2026-01-14 Vjekoslav Kovač , Bruno Predojević

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

计算几何 · 计算机科学 2019-12-11 Vincent Despré , Jean-Marc Schlenker , Monique Teillaud

A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…

组合数学 · 数学 2021-02-23 Ivan Vasenov

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

复变函数 · 数学 2025-05-22 Ilia Binder , David Pechersky

We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…

组合数学 · 数学 2021-11-24 Timothy Sun

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few…

数据结构与算法 · 计算机科学 2014-08-27 Michael A. Bekos , Martin Gronemann , Michael Kaufmann , Robert Krug

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

度量几何 · 数学 2016-10-11 Egon Schulte , Asia Ivić Weiss

Grid peeling is the process of repeatedly removing the convex hull vertices of the grid-points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous…

计算几何 · 计算机科学 2024-02-27 Günter Rote , Moritz Rüber , Morteza Saghafian

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…

组合数学 · 数学 2010-02-15 Radoslav Fulek , Balázs Keszegh , Filip Morić

We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…

软凝聚态物质 · 物理学 2012-12-17 Marcelo A. Dias , Christian D. Santangelo

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

度量几何 · 数学 2025-07-02 Bernhard Klaassen

Every conformal field theory has the symmetry of taking each field to its adjoint. We consider here the quotient (orbifold) conformal field theory obtained by twisting with respect to this symmetry. A general method for computing such…

高能物理 - 理论 · 物理学 2013-11-01 Doron Gepner , Herve Partouche