#include <vtkSimpleCellTessellator.h>
Inheritance diagram for vtkSimpleCellTessellator:
vtkSimpleCellTessellator is a helper class to perform adaptive tessellation of particular cell topologies. The major purpose for this class is to transform higher-order cell types (e.g., higher-order finite elements) into linear cells that can then be easily visualized by VTK. This class works in conjunction with the vtkGenericDataSet and vtkGenericAdaptorCell classes.
This algorithm is based on edge subdivision. An error metric along each edge is evaluated, and if the error is greater than some tolerance, the edge is subdivided (as well as all connected 2D and 3D cells). The process repeats until the error metric is satisfied. Since the algorithm is based on edge subdivision it inherently avoid T-junctions.
A significant issue addressed by this algorithm is to insure face compatibility across neigboring cells. That is, diagonals due to face triangulation must match to insure that the mesh is compatible. The algorithm employs a precomputed table to accelerate the tessellation process. The table was generated with the help of vtkOrderedTriangulator the basic idea is that the choice of diagonal is made only by considering the relative value of the point ids.
Definition at line 69 of file vtkSimpleCellTessellator.h.
|
Reimplemented from vtkGenericCellTessellator. Definition at line 73 of file vtkSimpleCellTessellator.h. |
|
|
|
|
|
Create an object with Debug turned off, modified time initialized to zero, and reference counting on. Reimplemented from vtkObject. |
|
Reimplemented from vtkGenericCellTessellator. |
|
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkGenericCellTessellator. |
|
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h. Reimplemented from vtkGenericCellTessellator. |
|
Reimplemented from vtkGenericCellTessellator. |
|
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes. Reimplemented from vtkGenericCellTessellator. |
|
Get the higher order cell in order to access the evaluation function. |
|
Tessellate a face of a 3D `cell'. The face is specified by the index value. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'.
Implements vtkGenericCellTessellator. |
|
Tessellate a 3D `cell'. The result is a set of smaller linear tetrahedra in `cellArray' with `points' and point data `internalPd'.
Implements vtkGenericCellTessellator. |
|
Triangulate a 2D `cell'. The result is a set of smaller linear triangles in `cellArray' with `points' and point data `internalPd'.
Implements vtkGenericCellTessellator. |
|
Reset the output for repeated use of this class. |
|
Initialize the tessellator with a data set `ds'. Implements vtkGenericCellTessellator. |
|
Return the number of fixed subdivisions. It is used to prevent from infinite loop in degenerated cases. For order 3 or higher, if the inflection point is exactly on the mid-point, error metric will not detect that a subdivision is required. 0 means no fixed subdivision: there will be only adaptive subdivisions. The algorithm first performs `GetFixedSubdivisions' non adaptive subdivisions followed by at most `GetMaxAdaptiveSubdivisions' adaptive subdivisions. Hence, there are at most `GetMaxSubdivisionLevel' subdivisions.
|
|
Return the maximum level of subdivision. It is used to prevent from infinite loop in degenerated cases. For order 3 or higher, if the inflection point is exactly on the mid-point, error metric will not detect that a subdivision is required. 0 means no subdivision, neither fixed nor adaptive.
|
|
Return the maximum number of adaptive subdivisions.
|
|
Set the number of fixed subdivisions. See GetFixedSubdivisions() for more explanations.
|
|
Set the maximum level of subdivision. See GetMaxSubdivisionLevel() for more explanations.
|
|
Set both the number of fixed subdivisions and the maximum level of subdivisions. See GetFixedSubdivisions(), GetMaxSubdivisionLevel() and GetMaxAdaptiveSubdivisions() for more explanations.
|
|
Extract point `pointId' from the edge table to the output point and output point data. |
|
|
|
|
|
|
|
|
|
|
|
Initialize `root' with the sub-tetra defined by the `localIds' points on the complex cell, `ids' are the global ids over the mesh of those points. The sub-tetra is also defined by the ids of its edges and of its faces relative to the complex cell. -1 means that the edge or the face of the sub-tetra is not an original edge or face of the complex cell.
|
|
Triangulate a triangle of `cell'. This triangle can be the top-level triangle if the cell is a triangle or a toplevel sub-triangle is the cell is a polygon, or a triangular face of a 3D cell or a top-level sub-triangle of a face of a 3D cell if the face is not a triangle. Arguments `localIds', `ids' and `edgeIds' have the same meaning than for InitTetraTile.
|
|
Allocate some memory if Scalars does not exists or is smaller than size.
|
|
|
|
|
|
|
|
Is the edge defined by vertices (`p1',`p2') in parametric coordinates on some edge of the original tetrahedron? If yes return on which edge it is, else return -1.
|
|
Return 1 if the parent of edge defined by vertices (`p1',`p2') in parametric coordinates, is an edge; 3 if there is no parent (the edge is inside). If the parent is an edge, return its id in `localId'.
|
|
Return 1 if the parent of edge defined by vertices (`p1',`p2') in parametric coordinates, is an edge; 2 if the parent is a face, 3 if there is no parent (the edge is inside). If the parent is an edge or a face, return its id in `localId'.
|
|
Allocate some memory if PointIds does not exist or is smaller than size.
|
|
Are the faces `originalFace' and `face' equal? The result is independent from any order or orientation.
|
|
Definition at line 356 of file vtkSimpleCellTessellator.h. |
|
Definition at line 357 of file vtkSimpleCellTessellator.h. |
|
HashTable instead of vtkPointLocator Definition at line 188 of file vtkSimpleCellTessellator.h. |
|
To access the higher order cell from third party library Definition at line 236 of file vtkSimpleCellTessellator.h. |
|
Scalar buffer used to save the interpolate values of the attributes The capacity is at least the number of components of the attribute collection ot the current cell. Definition at line 252 of file vtkSimpleCellTessellator.h. |
|
Definition at line 253 of file vtkSimpleCellTessellator.h. |
|
Number of double value to skip to go to the next point into Scalars array It is 6+attributeCollection->GetNumberOfComponents() Definition at line 257 of file vtkSimpleCellTessellator.h. |
|
Used to iterate over edges boundaries in GetNumberOfCellsUsingEdges() Definition at line 260 of file vtkSimpleCellTessellator.h. |
|
To access the higher order field from third party library Definition at line 263 of file vtkSimpleCellTessellator.h. |
|
To avoid New/Delete Definition at line 267 of file vtkSimpleCellTessellator.h. |
|
Allocate some memory if Scalars does not exists or is smaller than size.
Definition at line 268 of file vtkSimpleCellTessellator.h. |
|
Allocate some memory if Scalars does not exists or is smaller than size.
Definition at line 269 of file vtkSimpleCellTessellator.h. |
|
Dataset to be tessellated. Reimplemented from vtkGenericCellTessellator. Definition at line 313 of file vtkSimpleCellTessellator.h. |
|
Number of points in the dataset to be tessellated. Definition at line 316 of file vtkSimpleCellTessellator.h. |
|
Definition at line 318 of file vtkSimpleCellTessellator.h. |
|
Definition at line 319 of file vtkSimpleCellTessellator.h. |
|
Definition at line 320 of file vtkSimpleCellTessellator.h. |
|
For each edge (6) of the sub-tetra, there is the id of the original edge or -1 if the edge is not an original edge Definition at line 325 of file vtkSimpleCellTessellator.h. |
|
For each edge (6) of the sub-tetra, there is the id of the original edge or -1 if the edge is not an original edge Definition at line 329 of file vtkSimpleCellTessellator.h. |
|
Definition at line 336 of file vtkSimpleCellTessellator.h. |
|
Definition at line 340 of file vtkSimpleCellTessellator.h. |
|
Definition at line 343 of file vtkSimpleCellTessellator.h. |
|
Definition at line 346 of file vtkSimpleCellTessellator.h. |
|
Definition at line 348 of file vtkSimpleCellTessellator.h. |
|
Definition at line 349 of file vtkSimpleCellTessellator.h. |