triangulation_boundary_nodes, an Octave code which analyzes the triangulation of a region, and identifies each boundary node with the label "1".
Either a 3-node or 6-node triangulation may be used.
Although this boundary information is useful, it would be more useful to divide the boundary nodes up, if the boundary consists of more than one connected segment. Moreover, it would also be useful to report the sequence of nodes necessary to trace out a connected segment of the boundary.
triangulation_boundary_nodes ( 'prefix' )where prefix is the common filename prefix:
The computer code and data files described and made available on this web page are distributed under the MIT license
triangulation_boundary_nodes is available in a C++ version and a Fortran90 version and a MATLAB version and an Octave version.
triangulation_boundary_nodes_test
mesh_boundary, an Octave code which is given a mesh of a 2D region, formed by polygonal elements, and determines a sequence of pairs of polygonal vertices that define the boundary of the region.
triangulation, an Octave code which carries out various operations on order 3 ("linear") or order 6 ("quadratic") triangulations.
triangulation_boundary_edges, an Octave code which reads data defining a triangulation, determines which edges lie on the boundary, organizes them into connected components, and writes this information to a file.
triangulation_corner, an Octave code which patches triangulations so that no triangle has two sides on the boundary.
triangulation_delaunay_discrepancy, an Octave code which measures the amount by which a triangulation fails the local delaunay test;
triangulation_display, an Octave code which displays the nodes and elements of a triangulation on the MATLAB graphics screen;
triangulation_histogram, an Octave code which computes histograms of data over a triangulation.
triangulation_l2q, an Octave code which reads data defining a 3-node triangulation and generates midside nodes and writes out the corresponding 6-node triangulation.
triangulation_mask, an Octave code which takes an existing triangulation and deletes triangles and their corresponding nodes as requested by the user.
triangulation_order3, a data directory which contains a description and examples of order 3 triangulations.
triangulation_order6, a data directory which contains a description and examples of order 6 triangulations.
triangulation_orient, an Octave code which reads data defining a triangulation, makes sure that every triangle has positive orientation, and if not, writes a corrected triangle file.
triangulation_plot, an Octave code which reads data defining a triangulation and creates a postscript image of the nodes and triangles.
triangulation_q2l, an Octave code which reads data defining a 6-node triangulation, and subdivides each triangle into 4 3-node triangles, writing the resulting triangulation to a file.
triangulation_quad, an Octave code which estimates the integral of a function over a triangulated region.
triangulation_quality, an Octave code which reads data defining a triangulation and computes a number of quality measures.
triangulation_rcm, an Octave code which reads data defining a triangulation, determines an ordering of the nodes that will reduce the bandwidth of the adjacency matrix, and writes the new triangulation information to a file.
triangulation_refine, an Octave code which reads data defining a triangulation, replaces each triangle by four congruent smaller ones, and writes the new triangulation information to a file.
triangulation_triangle_neighbors, an Octave code which reads data defining a triangulation, determines the neighboring triangles of each triangle, and writes that information to a file.