Class triangle

python/pymesh/triangle.py:4–134

Wrapper around `Shewchuk's triangle `_. Attributes: points (:class:`numpy.ndarray`): 3D or 2D points to be triangulated. If points are embedded in 3D, they must be coplanar. segments (:class:`numpy.ndarray`): n by 2

from .meshio import form_mesh

class triangle(PyMesh.triangle):
    """ Wrapper around `Shewchuk's triangle
    <https://www.cs.cmu.edu/~quake/triangle.html>`_.

    Attributes:
        points (:class:`numpy.ndarray`): 3D or 2D points to be triangulated.
            If points are embedded in 3D, they must be coplanar.

        segments (:class:`numpy.ndarray`): n by 2 matrix of indices into points.
            together ``points`` and ``segments`` defines a Planar Straight Line
            Graph (PSLG) that triangles accepts.

        triangles (:class:`numpy.ndarray`): m by 3 matrix of indices into
            points.  When ``segments`` is empty and ``triangles`` is non-empty,
            use triangle to refine the existing triangulation.

        holes (:class:`numpy.ndarray`): h by dim matrix of points representing
            hole points.  Alternatively, one can set ``auto_hole_detection`` to
            True to infer holes from the input PSLG&#x27;s orientation.

        min_angle (``float``): Lower bound on angle in degrees.  Default is 20
            degress.  Setting ``min_angle`` > 20.7 will loose the theoretical
            guarentee of termination, although it often works fine in practice.
            However, setting ``min_angle`` > 34 tends to cause triangle to not
            terminate in practice.

        max_area (``float``): Max triangle area.  Default is unbounded.

        max_areas (:class:`numpy.ndarray`): Max area scalar field.  It should
            have the same length as triangles.  Not used by default.

        keep_convex_hull (``boolean``): Whether to keep all triangles inside of
            the convex hull.  Default is false.

        conforming_delaunay (``boolean``): Whether to enforce conforming
            Delaunay triangulation.  Default is false (i.e. use constrained
            Delaunay triangulation).

        exact_arithmetic (``boolean``): Whether to use exact predicates.
            Defeault is true.

        split_boundary (``boolean``): Whether to allow boundary to be split.
            Default is false.

        max_num_steiner_points (``int``): The maximum number of Steiner points.
            Default is -1 (i.e. unbounded).

        verbosity (``int``): How much info should triangle output?

            0. no output
            1. normal level of output
            2. verbose output
            3. vertex-by-vertex details
            4. you must be debugging the triangle code

        algorithm (``str``): The Delaunay triangulation algorithm to use.
            Choices are: