|
Options |
Description |
|
-p |
Triangulates a Planar Straight
Line Graph (.poly file). |
|
-r |
Refines a previously generated
mesh. |
|
-q |
Quality mesh generation. A minimum angle may be
specified. |
|
-a |
Applies a maximum triangle
area constraint. |
|
-u |
Applies a user-defined
triangle constraint. |
|
-A |
Applies attributes to identify
triangles in certain regions. |
|
-c |
Encloses the convex hull with
segments. |
|
-w |
Weighted Delaunay
triangulation. |
|
-W |
Regular triangulation (lower
hull of a height field). |
|
-j |
Jettison unused vertices from
output .node file. |
|
-e |
Generates an edge
list. |
|
-v |
Generates a Voronoi
diagram. |
|
-n |
Generates a list of triangle
neighbors. |
|
-g |
Generates an .off file for
Geomview. |
|
-B |
Suppresses output of boundary
information. |
|
-P |
Suppresses output of .poly
file. |
|
-N |
Suppresses output of .node
file. |
|
-E |
Suppresses output of .ele
file. |
|
-I |
Suppresses mesh iteration
numbers. |
|
-O |
Ignores holes in .poly
file. |
|
-X |
Suppresses use of exact
arithmetic. |
|
-z |
Numbers all items starting
from zero (rather than one). |
|
-o2 |
Generates second-order
subparametric elements. |
|
-Y |
Suppresses boundary segment
splitting. |
|
-S |
Specifies maximum number of
added Steiner points. |
|
-L |
Uses equatorial circles, not
equatorial lenses. |
|
-i |
Uses incremental method,
rather than divide-and-conquer. |
|
-F |
Uses Fortune's sweepline
algorithm, rather than d-and-c. |
|
-l |
Uses vertical cuts only,
rather than alternating cuts. |
|
-s |
Force segments into mesh by
splitting (instead of using CDT). |
|
-L |
Uses Ruppert's diametral
spheres, not diametral lenses. |
|
-C |
Check consistency of final
mesh. |
|
-Q |
Quiet: No terminal output except
errors. |
|
-V |
Verbose: Detailed information on what I'm
doing. |
|
-h |
Help: Detailed instructions for
Triangle. |