Classes |
| struct | Attribute |
| struct | VecAttribute< T > |
| struct | ArrayAttribute< T, n > |
| struct | ListAttribute< T > |
| struct | SetAttribute< T > |
| struct | RelationRep |
| struct | AttribRep |
| class | MeshEntity |
| struct | EntityRemovedPred |
| struct | BaseVertex |
| class | Vertex |
| struct | LowVertexDegreeCompare |
| struct | HighVertexDegreeCompare |
| struct | LowLayerCompare |
| struct | BaseEdge |
| class | Edge |
| struct | BaseFace |
| class | Face |
| struct | BoundingBox |
| struct | MeshFilter |
| class | Mesh |
| struct | MeshImporter |
| struct | MeshExporter |
| class | MeshOptimization |
| struct | SurfPatch |
| struct | QTrack |
| struct | StructuredMesh2D |
| struct | LaplaceWeight |
| struct | LaplaceNoWeight |
| struct | LaplaceLengthWeight |
| struct | LaplaceAreaWeight |
| class | LaplaceSmoothing |
| struct | LaplaceSmoothing::LVertex |
Namespaces |
| namespace | Jaal |
Defines |
| #define | FOR_EACH(container, iter) for(iter = container.begin(); iter != container.end(); ++iter) |
| #define | JAAL_SUCCESS 0 |
| #define | JAAL_GEOMETRIC_FAILURE 1 |
| #define | JAAL_TOP0LOGICAL_FAILURE 100 |
| #define | Break() |
| #define | TOPOLOGICAL_DISTANCE 0 |
| #define | EUCLIDEAN_DISTANCE 1 |
| #define | EUCLIDEAN_DISTANCE2 2 |
| #define | CITY_BLOCK_DISTANCE 3 |
Typedefs |
| typedef std::pair< size_t, size_t > | FacePair |
| typedef Vertex * | PNode |
| typedef Edge * | PEdge |
| typedef Face * | PFace |
| typedef std::vector< PNode > | NodeSequence |
| typedef std::vector< PEdge > | EdgeSequence |
| typedef std::vector< PFace > | FaceSequence |
| typedef std::list< PNode > | NodeList |
| typedef std::list< PEdge > | EdgeList |
| typedef std::list< PFace > | FaceList |
| typedef std::set< PNode > | NodeSet |
| typedef std::set< PFace > | FaceSet |
Functions |
| template<class T > |
| int | split_stl_vector (const std::vector< T > &a, size_t pos, std::vector< T > &b, std::vector< T > &c) |
| template<class T > |
| int | split_stl_vector (const std::deque< T > &a, size_t pos, std::deque< T > &b, std::deque< T > &c) |
| Mesh * | create_structured_mesh (double *origin, double *length, int *griddim, int spacedim) |
| Mesh * | quad_to_tri4 (Mesh *quadmesh, vector< Vertex * > &steiner) |
| Mesh * | quad_to_tri2 (Mesh *quadmesh) |
| void | set_tfi_coords (int i, int j, int nx, int ny, vector< Vertex * > &qnodes) |
| void | linear_interpolation (Mesh *m, Vertex *v0, Vertex *v1, int n, NodeSequence &seq) |
| void | advancing_front_triangle_cleanup (Mesh *mesh) |
| vector< QTrack > | generate_quad_partitioning (Mesh *mesh) |
| void | set_layer_tag (Mesh *m, const string &s="Layer") |
| void | set_inverted_tag (Mesh *m, const string &s="Inverted") |
| void | set_boundary_tag (Mesh *m, const string &s="Boundary") |
| void | set_partition_tag (Mesh *m, const string &s="Partition") |
| void | set_convexity_tag (Mesh *m, const string &s="Convexity") |
| void | set_regular_node_tag (Mesh *m, const string &s="Regularity") |
| void | set_visit_tags (Mesh *m) |
| void | set_allboundnodes_tag (Mesh *m) |
| void | set_constrained_tag (Mesh *m) |
| void | set_feature_angle_tag (Mesh *m) |
| void | set_ideal_node_tag (Mesh *m, int elemtype) |
| void | set_large_area_tag (Mesh *m) |
| void | set_tiny_area_tag (Mesh *m, double val=1.0E-06) |
| void | set_irregular_path_tag (Mesh *m, vector< QTrack > &qp) |
| int | quadrangulate (Mesh *mesh) |
| Mesh * | struct_tri_grid (int nx, int ny) |
| Mesh * | struct_quad_grid (int nx, int ny) |
| int | quad_concave_tests () |
| void | plot_all_quad_quality_measures (Jaal::Mesh *mesh) |
| void | plot_all_tri_quality_measures (Jaal::Mesh *mesh) |