resqpy.olio.triangulationΒΆ
triangulation.py: functions for finding Delaunay triangulation and Voronoi graph from a set of points.
Functions
Returns the centre of the circumcircle of the three points in the xy plane. |
|
Returns the Delauney Triangulation of 2D point set p. |
|
Returns unique edges as pairs of point indices, and a count of uses of each edge. |
|
Returns a subset of all edges where the edge count is 2. |
|
Modifies t in situ such that each triangle is clockwise in xy plane (viewed from -ve z axis). |
|
Returns a reoriented copy of a set of points, such that z axis is approximate normal to average plane of points. |
|
Returns a subset of all edges where the edge count is 1. |
|
Returns edge index and points index lists of distinct rims. |
|
Creates a set of points surrounding the point set p, in the xy plane. |
|
Returns list-like 1D int array of indices of triangles using edge identified by pair of point indices. |
|
Returns int array of shape (len(edges), 2) with indices of upto 2 triangles using each edge (-1 for unused). |
|
Returns list-like 1D int array of indices of triangles using vertex identified by point_index. |
|
Returns triangulation of polygons using centres as extra points. |
|
Returns dual Voronoi diagram for a Delauney triangulation. |