中文
相关论文

相关论文: Transforming triangulations on non planar-surfaces

200 篇论文

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

几何拓扑 · 数学 2007-05-23 Simon A. King

We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.

几何拓扑 · 数学 2019-07-03 Guillaume Tahar

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

We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.

离散数学 · 计算机科学 2024-06-25 Thomas Fernique , Olga Mikhailovna Sizova

We show that $O(n^2)$ exchanging flips suffice to transform any edge-labelled pointed pseudo-triangulation into any other with the same set of labels. By using insertion, deletion and exchanging flips, we can transform any edge-labelled…

计算几何 · 计算机科学 2015-12-07 Prosenjit Bose , Sander Verdonschot

We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…

组合数学 · 数学 2019-04-30 Markus Baumeister

Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…

组合数学 · 数学 2019-07-23 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

计算几何 · 计算机科学 2012-05-14 Anna Lubiw , Vinayak Pathak

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

计算几何 · 计算机科学 2015-05-13 Alexander Pilz

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…

计算几何 · 计算机科学 2007-12-13 Siu-Wing Cheng , Tamal K. Dey

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

组合数学 · 数学 2021-03-09 S. Lawrencenko , T. Sulanke , M. T. Villar , L. V. Zgonnik , M. J. Chávez , J. R. Portillo

A flip is a minimal move between two triangulations of a polytope. An open question is whether any two triangulations of the product of two simplices can be connected through a series of flips. This was proven in the case where one of the…

组合数学 · 数学 2016-01-25 Gaku Liu

We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…

几何拓扑 · 数学 2021-02-19 Alan McLeay , Hugo Parlier

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

计算几何 · 计算机科学 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…

组合数学 · 数学 2008-09-09 Prosenjit Bose , Jurek Czyzowicz , Zhicheng Gao , Pat Morin , David R. Wood

The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…

组合数学 · 数学 2026-01-14 Keyi Jin , Linming Lu , Erxiao Wang , Lijuan Wu , Min Yan

We prove that any length metric space homeomorphic to a surface may be decomposed into non-overlapping convex triangles of arbitrarily small diameter. This generalizes a previous result of Alexandrov--Zalgaller for surfaces of bounded…

度量几何 · 数学 2022-06-13 Paul Creutz , Matthew Romney

We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…

几何拓扑 · 数学 2020-11-05 Ariadna Fossas , Hugo Parlier

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds…

几何拓扑 · 数学 2015-09-15 Valentina Disarlo , Hugo Parlier

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

组合数学 · 数学 2013-06-04 M. J. Chávez , S. Lawrencenko , A. Quintero , M. T. Villar
‹ 上一页 1 2 3 10 下一页 ›