# Questions tagged [triangulations]

The triangulations tag has no usage guidance.

**1**

vote

**0**answers

176 views

### dissections and vertices of non-convex polytopes

Let us call a finite union $P$ of $n$-dimensional compact convex polytopes in $\mathbb{R}^n$ a non-convex polytope. Recall that a dissection of $P$ is a finite collection $T$ of $n$-dimensional ...

**6**

votes

**1**answer

287 views

### What is known about the distribution of average edge-degrees for 3-manifold triangulations (with the number of 3-simplices less than a fixed constant)?

This is my first question on mathoverflow! It relates to a project I'm undertaking with a student.
Work by Tamura (extending results by Luo and Stong) shows that for any closed 3-manifold $M$ and any ...

**27**

votes

**1**answer

1k views

### High-Dimensional Analogs of Polygon Spaces

[Edit: I had a mistake in the numerology (took d=6,5 instead of d=5,4). Edit: I mistakenly identified my mistake, it is 6,5 but I got the indices shifted by one.]
Background: Polygon spaces
Given a ...

**3**

votes

**1**answer

2k views

### practical algorithm for constrained triangulation in two dimensions?

I'm looking for an algorithm that is easy to implement in practice (resulting in small amount of code), preferably incremental. As far as I know, the biggest problem with incremental constrained ...

**8**

votes

**3**answers

702 views

### Efficient topological triangulations of non-convex polyhedra

Does every polyhedron in $\mathbb{R}^3$ with $n$ triangular facets have a topological triangulation with complexity $O(n)$?
Suppose $P$ is a non-convex polyhedron in $\mathbb{R}^3$ with $n$ ...

**11**

votes

**2**answers

2k views

### Proving the Gauss-Bonnet theorem for embedded surfaces using triangulations

I heard this really neat elementary proof of the "Gauss-Bonnet Theorem" :
Let $S$ be a surface embedded in $\mathbb{R}^3$. Now take a triangulation of that surface, and approximate the surface with a ...

**6**

votes

**1**answer

492 views

### Triangulation of Surfaces without Jordan-Schoenflies

Does anyone know of a proof of the fact that any 2-manifold can be triangulated that does not use the Jordan-Curve Theorem or the Jordan-Schoenflies Theorem? Thanks for your help

**0**

votes

**1**answer

2k views

### 3D Delaunay Triangulation -> Euclidean Minimum Spanning Tree

I read that the Euclidean Minimum Spanning Tree (EMST) of a set of points is a subgraph of any Delaunay triangulation. Apparently the easiest/fastest way to obtain the EMST is to find the Deluanay ...