Canadian Journal of Mathematics · 1962 · 577 citations · 2 references
Natural SciencesMathematicsComputational GeometryGeometryTopologyConvex GeometryDiscrete GeometryTriangulation AlgorithmsTriangulations
Let P be a closed region in the plane bounded by a simple closed curve, and let S be a simplicial dissection of P . We may say that S is a dissection of P into a finite number α of triangles so that no vertex of any one triangle is an interior point of an edge of another. The triangles are ‘'topological” triangles and their edges are closed arcs which need not be straight segments. No two distinct edges of the dissection join the same two vertices, and no two triangles have more than two vertices in common.
2
Nature · 1916 · 2.7K citations
Convex Representations of Graphs
W. T. Tutte · Proceedings of the London Mathematical Society · 1960 · 281 citations