Suppose we are given a planar graph G, and we would like to triangulate it, then functions such as TriangulateMesh can help us obtain a triangulation of G. I am wondering if there is a built-in function that would show what edges we can add to obtain a triangulation of G.
albertt22
(Yun-chi Tang)
1
mikebesso
(Mike Besso)
2
check out: Triangulated Graph -- from Wolfram MathWorld
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| How to compute the triangles of a graph via pattern matching? | 2 | 12795 | September 13, 2015 | |
| IGraph/M showcase: meshes, planarity, symmetry, colouring | 4 | 20253 | April 6, 2020 | |
| Export P1 function on a mesh to Mathematica | 10 | 5037 | January 25, 2022 | |
| How to generate a "triangular" graph for arbitrary given depth? | 4 | 2401 | March 22, 2025 | |
| UndirectedGraphs: a paclet of dedicated functions for some graph families | 0 | 1751 | July 8, 2023 |