Skip to main content

All Questions

Filter by
Sorted by
Tagged with
14 votes
0 answers
420 views

Minimum number of distinct triangles for tesselating the sphere

Consider sequences of tesselations of the sphere. For instance, one such sequence might start with an icosahedron and proceed by subdividing each triangle face into 4 triangles and projecting the new ...
Arthur B's user avatar
  • 1,902
8 votes
3 answers
793 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$ ...
JeffE's user avatar
  • 436
1 vote
0 answers
132 views

What is the difference between a simple polyhedron and a triangulated graph?

On a famous website I've seen the following: The skeletons of the simple polyhedra correspond to the triangulated graphs, the smallest of which are illustrated above. That "illustration above&...
PatL's user avatar
  • 11