Triangulator

from acron.core import Triangulator

class Triangulator

Bases:

Bases: MemoryBase

This class can triangulate a convex or concave polygon, even one with holes. It is adapted from an algorithm published as:

Narkhede A. and Manocha D., Fast polygon triangulation algorithm based on Seidel’s Algorithm, UNC-CH, 1994.

http://www.cs.unc.edu/~dm/CODE/GEM/chapter.html

It works strictly on 2-d points. See Triangulator3 for 3-d points.

Inheritance diagram

digraph inheritance9007a5e397 { bgcolor=transparent; rankdir=BT; size="8.0, 12.0"; "DTOOL_SUPER_BASE" [fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=11,height=0.25,shape=box,style=""]; "Triangulator" [URL="acron.core.Triangulator.html#acron.core.Triangulator",fillcolor=white,fontname="Vera Sans, DejaVu Sans, Liberation Sans, Arial, Helvetica, sans",fontsize=11,height=0.25,shape=box,style="",target="_top",tooltip="/**"]; "DTOOL_SUPER_BASE" -> "Triangulator" [arrowsize=0.75,style=""]; }

__init__()

add_hole_vertex()

Adds the next consecutive vertex of the current hole. This vertex should index into the vertex pool established by repeated calls to add_vertex().

The vertices may be listed in either clockwise or counterclockwise order. Vertices should not be repeated.

add_polygon_vertex()

Adds the next consecutive vertex of the polygon. This vertex should index into the vertex pool established by repeated calls to add_vertex().

The vertices may be listed in either clockwise or counterclockwise order. Vertices should not be repeated. In particular, do not repeat the first vertex at the end.

add_vertex()

Adds a new vertex to the vertex pool. Returns the vertex index number.

Adds a new vertex to the vertex pool. Returns the vertex index number.

begin_hole()

Finishes the previous hole, if any, and prepares to add a new hole.

clear()

Removes all vertices and polygon specifications from the Triangulator, and prepares it to start over.

clear_polygon()

Removes the current polygon definition (and its set of holes), but does not clear the vertex pool.

get_num_triangles()

Returns the number of triangles generated by the previous call to triangulate().

get_num_vertices()

Returns the number of vertices in the pool. Note that the Triangulator might append new vertices, in addition to those added by the user, if any of the polygon is self-intersecting, or if any of the holes intersect some part of the polygon edges.

get_triangle_v0()

Returns vertex 0 of the nth triangle generated by the previous call to triangulate().

This is a zero-based index into the vertices added by repeated calls to add_vertex().

get_triangle_v1()

Returns vertex 1 of the nth triangle generated by the previous call to triangulate().

This is a zero-based index into the vertices added by repeated calls to add_vertex().

get_triangle_v2()

Returns vertex 2 of the nth triangle generated by the previous call to triangulate().

This is a zero-based index into the vertices added by repeated calls to add_vertex().

get_vertex()

Returns the nth vertex.

get_vertices() → list

is_left_winding()

Returns true if the polygon vertices are listed in counterclockwise order, or false if they appear to be listed in clockwise order.

triangulate()

Does the work of triangulating the specified polygon. After this call, you may retrieve the new triangles one at a time by iterating through get_triangle_v0/1/2().

property vertices → Sequence[LPoint2d]

Returns the nth vertex.