## New answers tagged triangulations

6
votes

### Estimating shortest paths in planar drawings of graphs

Looks like Saúl RM has already achieved an arbitrarily high distance.
Here's a simpler construction that at least gets distance $> 1$.
The square has vertices $(\pm1/2, \pm1/2)$.
The vertices near ...

5
votes

Accepted

### Estimating shortest paths in planar drawings of graphs

Here are triangulations of a side $1$ square with vertices at a arbitrarily high distance of all the four vertices of the square. The sides of the side $1$ square are not edges but it is easy to see ...

9
votes

Accepted

### existence of triangulations of manifolds

In general, the answer is no. For an example, suppose that $K$ is the boundary of the four-simplex. Thus $K$ is a triangulation of the three-sphere. Now every closed connected oriented surface of ...

Top 50 recent answers are included

#### Related Tags

triangulations × 124gt.geometric-topology × 42

discrete-geometry × 25

mg.metric-geometry × 23

co.combinatorics × 21

graph-theory × 15

manifolds × 15

simplicial-complexes × 14

convex-polytopes × 13

computational-geometry × 13

at.algebraic-topology × 11

smooth-manifolds × 10

gn.general-topology × 9

3-manifolds × 8

dg.differential-geometry × 7

hyperbolic-geometry × 7

reference-request × 6

differential-topology × 6

riemannian-geometry × 5

euclidean-geometry × 5

topological-manifolds × 5

polyhedra × 3

4-manifolds × 3

cobordism × 3

hamiltonian-graphs × 3