| iss/accessors.h [code] | Implements accessors for IndSimpSet |
| simplicial/accessors.h [code] | Implements accessors operations for SimpMeshRed |
| Ball.h [code] | |
| BBox.h [code] | Implements a class for an axes-oriented bounding box in N dimensions |
| BBoxTree.h [code] | A class for a bounding box tree in N-D |
| boundary.cc | Extract the boundary of a simplicial mesh |
| boundaryCondition.h [code] | Boundary condition functions for indexed simplex sets |
| boundaryIndices.cc | Extract the indices of the boundary nodes of a simplicial mesh |
| iss/build.h [code] | Implements builders for IndSimpSet |
| simplicial/build.h [code] | Functions to build edges in a SimpMeshRed<2,2> |
| buildFromSimplices.h [code] | Implements a builder for IndSimpSet |
| buildSubsetMesh.cc | Build a subset of the input mesh |
| CellArray.h [code] | A class for a cell array in N-D |
| CellArrayBase.h [code] | A base class for a cell array in N-D |
| CellArrayStatic.h [code] | A class for a static cell array in N-D |
| cellAttributes.cc | Computes cell attributes for simplicial meshes |
| cellAttributes.h [code] | Implements cell attribute measures for IndSimpSet |
| CellBinarySearch.h [code] | A class for a cell array coupled with a binary search |
| CellForwardSearch.h [code] | A class for a cell array coupled with a forward search |
| CellForwardSearchKey.h [code] | A class for a sparse cell array in 3-D |
| CellSearch.h [code] | A base class for a cell array with searching in N-D |
| centerPointMesh.cc | Create a mesh from the boundary and an center point |
| Circle3.h [code] | |
| CircularArc3.h [code] | |
| coarsen.cc | Coarsen the mesh by collapsing edges |
| coarsen.h [code] | Functions to coarsen the cells in a SimpMeshRed |
| coarsenCells.cc | Remove the specified cells by collapsing edges |
| ComplexWithFreeVertex.h [code] | A local simplicial complex with a free node at the center |
| ComplexWithFreeVertexOnManifold.h [code] | A local simplicial complex with a free node at the center |
| computeCentroids.cc | Compute the centroids of the cells |
| computeSignedDistance.cc | Computes cell attributes for simplicial meshes |
| contact.h [code] | Remove contact |
| content.h [code] | Define functions to compute content (length, area, volume, etc.) |
| convertQuadToTriangle.cc | Convert a quadrilateral mesh to a triangle mesh |
| CyclicIndex.h [code] | |
| decomposition.h [code] | Functions for decomposing the Jacobian |
| defs.h [code] | Definitions for the computational geometry package |
| kernel/distance.h [code] | Define functions to compute distance |
| mesh/iss/distance.h [code] | Compute the distance to a simplicial mesh for a single point |
| distinct_points.h [code] | From a set of points, generate an indexed set of distinct points |
| DistributedOrthtree.h [code] | An orthtree that uses distributed-memory concurrency |
| EdgeIterator.h [code] | |
| EdgeRemoval.h [code] | Class for edge removal in a tetrahedral mesh |
| equality.h [code] | Equality operators for IndSimpSet |
| extractEdgesOnEdgeFeatures32.cc | Extract the edge features of a 3-2 manifold |
| extractFeatures32.cc | Extract the edge features of a 3-2 manifold |
| FaceIterator.h [code] | A face iterator in SimpMeshRed |
| FaceRemoval.h [code] | Class for edge removal in a tetrahedral mesh |
| iss/file_io.h [code] | Implements file I/O operations for IndSimpSet |
| simplicial/file_io.h [code] | Implements file I/O operations for SimpMeshRed |
| fit.h [code] | Fit a mesh to a level-set description |
| fitBoundary.cc | |
| fitMesh.cc | |
| flip.cc | Flip edges to improve the quality of the mesh |
| flip.h [code] | Functions to flip edges in a SimpMeshRed<2,2> |
| functor.h [code] | Various functors for simplices |
| geom.h [code] | |
| geometricOptimize.cc | Optimization of vertex locations with a boundary manifold constraint |
| iss/geometry.h [code] | Geometric functions for indexed simplex sets |
| simplex/geometry.h [code] | Geometric functions for simplices |
| simplicial/geometry.h [code] | Geometric functions |
| geomOptBoundaryCondition.cc | Optimization of vertex locations with a boundary constraint |
| geomOptContentConstraint.cc | Optimization of vertex locations with a content constraint |
| getVertices.cc | Get the vertices from an indexed simplex set file |
| grid.h [code] | Includes the RegularGrid class |
| identifyLowQualityWithCondNum.cc | Identify the low quality elements |
| inc_opt.h [code] | Incidence optimization |
| incidenceOptimize.cc | Optimize the incidence relations |
| IndexedEdgePolyhedron.h [code] | Implements a class for an indexed edge polyhedron in 3-D |
| IndSimpSet.h [code] | Implements a mesh that stores vertices and indexed simplices |
| IndSimpSetIncAdj.h [code] | An indexed simplex set in N-D that optimizes simplex quality |
| insert.h [code] | Insert cells into a SimpMeshRed |
| Interval.h [code] | Implements a class for an axes-oriented interval in N dimensions |
| iss.h [code] | Includes the classes for indexed simplex sets |
| iss2vtk.cc | Convert an indexed simplex set file to a VTK file |
| ISS_Interpolate.h [code] | Interpolation on an indexed simplex set |
| ISS_SignedDistance.h [code] | Signed distance to a simplicial mesh |
| ISS_SimplexQuery.h [code] | Simplex queries on an indexed simplex set |
| ISS_VertexField.h [code] | Interpolation on an indexed simplex set |
| IssiaFaceIterator.h [code] | |
| jacobianDecomposition.cc | Computes the decomposition of the Jacobian given a simplex |
| KDTree.h [code] | A class for a kd-tree in N-D |
| kernel.h [code] | Includes the classes in the kernel sub-package |
| laplacian.cc | Apply sweeps of Laplacian smoothing to the interior vertices |
| iss/laplacian.h [code] | Implements Laplacian smoothing |
| simplicial/laplacian.h [code] | Implements Laplacian smoothing |
| laplacian21.cc | Apply sweeps of Laplacian smoothing to the vertices of a curve |
| laplacianBoundary.cc | Apply sweeps of Laplacian smoothing to the boundary vertices |
| laplacianSolve.cc | Apply Laplacian smoothing to the interior vertices |
| LevelCoordinatesComposite.h [code] | CONTINUE |
| LevelCoordinatesNonInterleavedFixedPosition.h [code] | CONTINUE |
| Line_2.h [code] | |
| manipulators.h [code] | Implements operations that manipulators a SimpMeshRed |
| mapSimplexJac.cc | Map a simplex using a Jacobian matrix |
| mapSimplexOSA.cc | Map a simplex using the orientation, skew and aspect ratio matrices |
| Merge.h [code] | Merging functors |
| mesh.h [code] | Includes the data structures and algorithms for generating and optimizing simplicial (triangle, tetrahedral, etc.) meshes |
| moveBoundary.cc | Move the boundary vertices of an N-D mesh to lie on an (N-1)-D mesh |
| Node_AllIncCells.h [code] | Class for a vertex in a mesh |
| Node_OneIncCell.h [code] | Class for a vertex in a mesh |
| Node_VertSelf.h [code] | A node in a simplicial mesh that stores a vertex and an iterator to itself |
| Node_VertSelfId.h [code] | A node in a simplicial mesh that stores a vertex, an iterator to itself, and an identifier |
| nodesOnManifold.cc | Get the indices of the nodes on the manifold |
| Octree.h [code] | A class for an octree in 3-D |
| onManifold.h [code] | Implements on-manifold operations for IndSimpSet |
| optimize.h [code] | Implements file I/O operations for IndSimpSet |
| orient.cc | Try to orient the simplices in the mesh |
| orientation.h [code] | Functions to compute orientation |
| orientPositive.cc | Orients simplicial meshes |
| orq.h [code] | Includes the Orthogonal Range Query in N-D classes |
| orq/orq.h [code] | A base class for a data structure for doing orthogonal range queries in N-D |
| OrthtreeElementNull.h [code] | CONTINUE |
| OrthtreeMap.h [code] | An orthant tree that uses std::map |
| ParametrizedLine.h [code] | |
| ParametrizedPlane.h [code] | |
| penetration.cc | Report penetrations of a solid mesh |
| penetration.h [code] | Report penetrations |
| penetrationElasticSurface.cc | Push a solid mesh into an elastic surface |
| penetrationSphereCube.cc | Push a solid mesh into an elastic surface |
| penetrationSpheres.cc | Push a solid mesh into an elastic surface |
| Placebo.h [code] | A placebo class |
| PlaceboCheck.h [code] | A placebo class |
| Plane.h [code] | Implements a class for a plane in 3 dimensions |
| Point.h [code] | Define functions to treat a std::tr1::array as a point or vector |
| PointsOnManifold.h [code] | Represent the features of a mesh |
| PointsOnManifold321.h [code] | Represent the features of a 3-2 mesh |
| PointsOnManifoldN11.h [code] | Represent the features of a N-1 mesh |
| polytope.h [code] | Includes the polygon and polyhedron classes |
| quadrilateral.h [code] | Includes the files for quadrilateral meshes |
| quality.cc | Computes the quality metrics for simplicial meshes |
| iss/quality.h [code] | Implements quality measures for IndSimpSet |
| simplicial/quality.h [code] | Implements quality measures for SimpMeshRed |
| randomize.cc | Randomly move the vertex locations for simplicial meshes |
| refine.cc | Refine the mesh by splitting edges |
| refine.h [code] | Functions to refine the cells in a SimpMeshRed |
| refineBoundary.cc | Refine the boundary cells to more closely match a curve/surface |
| refineBoundaryDistance.cc | Refine according to the distance from the boundary |
| refineCells.cc | Refine the specified cells by splitting edges |
| RegularGrid.h [code] | A class for a regular grid |
| removeDuplicateVertices.cc | Remove duplicate vertices |
| removeLowAdjacencies.cc | Remove simplices until there are none with minimum adjacencies less than specified |
| reverseOrientation.cc | Reverse the orientation of a mesh |
| ScanConversionPolygon.h [code] | |
| ScanConversionPolyhedron.h [code] | A class for a polyhedron in 3-D designed for scan conversion |
| Segment.h [code] | |
| SegmentMath.h [code] | |
| selectCells.cc | Select cells that have an attribute in a specified range |
| SemiOpenInterval.h [code] | Implements a class for an axes-oriented semi-open interval in N dimensions |
| SequentialScan.h [code] | The sequential scan algorithm |
| iss/set.h [code] | Implements set operations for IndSimpSet |
| simplicial/set.h [code] | Implements operations that set a SimpMeshRed |
| simplex.h [code] | Includes the classes for algebraic simplex quality measures |
| simplex_distance.h [code] | Functions for determining the distance to a simplex |
| SimplexAdj.h [code] | Simplex-simplex adjacencies in an indexed simplex set in N-D |
| SimplexAdjJac.h [code] | Implements operations for the adjoint Jacobian matrix of a simplex |
| SimplexAdjJacQF.h [code] | Quality function of the Jacobian and its adjoint |
| SimplexCondNum.h [code] | Implements the condition number quality metric |
| SimplexIterator.h [code] | A simplex iterator for an indexed simplex set |
| SimplexJac.h [code] | Implements operations for the Jacobian matrix of a simplex |
| SimplexJacQF.h [code] | Simplex quality functions of the Jacobian matrix |
| SimplexMeanRatio.h [code] | Implements the mean ratio quality metric |
| SimplexModCondNum.h [code] | Implements the modified condition number quality metric |
| SimplexModDet.h [code] | Implements operations for modifying the determinant of the Jacobian |
| SimplexModMeanRatio.h [code] | Implements the mean ratio quality metric |
| simplexQuality.cc | Computes the quality metrics for a simplex |
| SimplexWithFreeVertex.h [code] | Implements a class for a simplex with a free vertex |
| simplicial.h [code] | Includes the classes for topological optimization of simplicial meshes |
| SimpMeshRed.h [code] | Class for a tetrahedral mesh with topological optimization capabilities |
| SmrCell.h [code] | Class for a cell in a simplicial mesh that stores the handles to the adjacent cells |
| SmrNode.h [code] | Class for a vertex in a mesh |
| solveLaplacian.h [code] | Implements Laplacian solve |
| SortFirst.h [code] | A class for a vector of records in N-D sorted in each dimension |
| SortFirstDynamic.h [code] | A class for a vector of records in N-D sorted in each dimension |
| SortProject.h [code] | A class for a vector of records in N-D sorted in each dimension |
| SortRankProject.h [code] | A class for a coordinate sorted and ranked vector of grid elements in N-D. The class implements the point-in-box method |
| SparseCellArray.h [code] | A class for a sparse cell array in N-D |
| SpatialIndex.h [code] | N-D spatial index that uses both interlaced and non-interlaced representations |
| spatialIndexing.h [code] | Includes the spatial indexing classes |
| Split.h [code] | Splitting functors |
| splitComponents.cc | Split the connected components of a mesh |
| structured_grid.h [code] | Includes the classes for structured grids |
| StructuredGrid.h [code] | Implements a class for a structured grid |
| subdivide.cc | Subdivide the mesh by splitting elements |
| subdivide.h [code] | Subdivision (Uniform in 1-D and 2-D.) |
| subspace.cc | Subspace method |
| tile.cc | Tile a faceted curve or surface |
| iss/tile.h [code] | Tile a rectilinear region with simplices |
| simplicial/tile.h [code] | Tile a rectilinear region with a simplicial mesh |
| topologicalOptimize.cc | Topological optimization via edge and face removal for tetrahedral meshes |
| topologicalOptimize.h [code] | Functions to topologicalOptimize the cells in a SimpMeshRed |
| iss/topology.h [code] | Topological functions for indexed simplex sets |
| simplex/topology.h [code] | Geometric functions for simplices |
| simplicial/topology.h [code] | Topological functions |
| transfer.h [code] | Transfer fields for indexed simplex sets |
| iss/transform.h [code] | Implements operations that transform a IndSimpSet |
| simplicial/transform.h [code] | Implements operations that transform a SimpMeshRed |
| tree.h [code] | Includes the tree data structure classes |
| Triangle.h [code] | Implements a class for a triangle |
| valid.h [code] | Functions to valid edges in a SimpMeshRed<2,2> |
| VertexSimplexInc.h [code] | Vertex-simplex incidences in an M-D indexed simplex set |