Tagged Questions

The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
0answers
13 views

Is Delaunay triangulation allowed to add nodes? [migrated]

I'm trying to compunte a triangulation in R with package RTriangle. The triangulations is based on 911 points, but after the process I have 1006 points. My question is: why there is an increase of ...
2
votes
1answer
65 views

Triangulations of translation surfaces whose edges are shorter than the diameter

Let $S$ be a compact translation surface (i.e. a surface endowed with a singular flat metric such that singular points are locally isometric to a cone of angle an integer multiple of $2\pi$, and that ...
7
votes
1answer
135 views

How many maximal triangulations of a rectangle?

I posted the following question on MathStackExchange, but I didn't any answer. So please let me post it on MathOverflow. Let $L_{m,n}\subset\mathbb R^2$ be a rectangle given by $[0,m]×[0,n]$ with ...
7
votes
1answer
92 views

Dropping altitudes to achieve nonobtuse planar triangulations: finite or infinite?

Given a planar triangulation of (say) a convex region, imagine the following process to convert it to a triangulation with no obtuse angles: Pick an arbitrary obtuse angle at vertex $a$ of ...
14
votes
0answers
143 views

Finite union of closed convex sets is triangulable?

I posted this question on Stackoverflow, but didn't get an answer. Let $A_1, \ldots, A_k \subseteq \mathbb{R}^n$ be closed convex sets. Is the union $\bigcup_{i=1}^k A_i$ triangulable, that is, ...
0
votes
1answer
56 views

mean length of the non-crossing graphs on n points

My original question is rather vague so I'll start with a precise example and then indicate possible generalisations. Given a n-tuple $x=(x_1,\dots,x_n)$ in, say, a square with side-length $1$ in the ...
2
votes
0answers
75 views

Simplex in convex polytope, pulling triangulation

Let $P$ be a convex $d$-dimensional polytope. I have two questions, related to triangulations of $P$. Question 1: Let $p$ be in the interior of $P$. Can I always find a triangulation of $P$, such ...
4
votes
0answers
131 views

Most regular way to triangulate $\mathbb{R}^3$?

By "regular", I'm going by a property of Delaunay Triangulation, which is to maximize the minimum angle. In $\mathbb{R}^2$, tiling with equilateral triangles gives you a minimum angle of 60 degrees. ...
6
votes
1answer
583 views

How can gauge theory techniques be useful to study when topological manifolds can be triangulated?

I was reading a review article arXiv:1310.7644 and it was explained there that in the last few years it was proven that there are topological manifolds of dimension greater than four that cannot be ...
3
votes
1answer
167 views

Hamiltonian circuit

Let us consider a disk with one labelled point on the boundary and $n$ labelled points in the interior. Let T be a triangulation of the whole disk with vertices on the labelled points such that T ...
3
votes
0answers
180 views

(∞,n)-category of triangulated cobordisms

What is an accepted definition of a (∞,n)-category of triangulated cobordisms? Is there one that has a forgetful functor to (Rezk - Hopkins -) Lurie's smooth cobordisms? Does it shed light on how ...
2
votes
0answers
113 views

Homotoping a 2-plane field on a closed orientable 3-manifold to a contact structure

I am a beginner in Contact Geometry. To prove that the inclusion $\text{Cont}(M)\hookrightarrow \text{Dist}(M)$ induces surjection at $\pi_0$ level, the closest I got was based on Ko Honda's notes. ...
6
votes
2answers
191 views

Comparing different layered structures for fibered 3-manifolds: example request.

Let's consider a fibering hyperbolic 3-manifold obtained as a mapping torus over some hyperbolic surface with pseudo-Anosov monodromy, and let's suppose that the surface is punctured at the singular ...
11
votes
2answers
542 views

What are some triangulations of Grassmannians?

A while ago I heard that there was no known triangulation of the Grassmannian of 3-planes in 6-space. To believe a statement like that, you have to be a little bit ungenerous about what you mean by ...
4
votes
5answers
294 views

Characterizing Convex Configurations of Quadrupels of Coplanar Points via Linear (In-)equalities between Distance Sums or Differences

Given 4 points $A$, $B$, $C$ and $D$ in general position in the euclidean plane, is it possible to determine from the 6 distances $AB$, $BC$, $CD$, $AD$, $AC$ and, $BD$ alone, whether every point is a ...
7
votes
1answer
228 views

Smoothing of piecewise Euclidean Riemannian metrics

Let $M$ be a smooth closed manifold and $T$ be a triangulation of $M$. Endow each simplex of $T$ with the Euclidean metric making it a regular simplex; this gives a piecewise Euclidean metric $g_0$ on ...
6
votes
1answer
240 views

coincidence between minimal triangulation numbers and chromatic numbers

A friend and I were reading up on the classification of compact surfaces when we realized that the minimal number of triangles in a triangulation of the sphere, torus, and projective plane are 4 ...
12
votes
1answer
473 views

Comparing layered triangulations of 3-manifolds which fiber over the circle.

I am sorry but I am reposting this question because I wasn't logged in when I first asked it. Ian Agol has produced a method to build an ideal layered triangulation of a hyperbolic 3-manifold which ...
2
votes
2answers
466 views

Euclidean triangulation of the plane with degree 7 at each vertex.

Hyperbolic plane has a beautiful triangulation by congruent hyperbolic triangles where all the vertices of the triangulation have degree 7, this is of course not possible in the euclidean plane, even ...
4
votes
0answers
179 views

Mean number of $n$-simplices per $(n-2)$-simplex in a triangulated $n$-manifold

Work by Tamura (extending results by Luo and Stong) shows the following. Theorem: For any closed 3-manifold $M$ and any rational number $4.5 < r < 6$ there is a triangulation $T$ of $M$ for ...
1
vote
0answers
144 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
1answer
260 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 ...
26
votes
1answer
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 ...
2
votes
1answer
628 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
3answers
632 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
2answers
827 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 ...
5
votes
1answer
360 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