(vertices_2d, segments)
| 802 | |
| 803 | |
| 804 | def _triangulate_python(vertices_2d, segments): |
| 805 | segments = segments.reshape(len(segments) // 2, 2) |
| 806 | T = Triangulation(vertices_2d, segments) |
| 807 | T.triangulate() |
| 808 | vertices_2d = T.pts |
| 809 | triangles = T.tris.ravel() |
| 810 | return vertices_2d, triangles |
| 811 | |
| 812 | |
| 813 | def _triangulate_cpp(vertices_2d, segments): |
no test coverage detected
searching dependent graphs…