Go to Overview over all GrAL packages.

---

                   

---

Todo List

page Index of the GrAL Base Package, part of the GrAL (Grid Algorithms Library)

Namespace gral

Class cell_morphism

Specialize if grids have consecutive handles

Add support for inverse mapping

construct from vertex morphism

Class cell_seq_ref

what's up with end() ?

Class edge_facet_intersection

This works only for linear edges and facets with 3 or 4 vertices. In the 3-vertex case, a linear facet is assumed. In the 4-vertex case, the convex hull of the vertices (a tetrahedron) is checked for intersection with the edge.

Class enumerated_subrange

Edges work correctly only for 2D.

Class enumerated_subrange_ref

Facets work correctly only for 2D.

Class facet_span_of_vertices_iterator

shallow copy / copy-on-write

Class grid_function_hash_base

Optimization: Could use hash_table<element_handle,T> instead of hash_table<Element,T>

Class disjoint_union_view::grid_view

support archetypes.

Class IstreamComplex2DCombFmt

Iterator classes refer to IstreamComplex2DFmt_base.

Class multi_grid_function

Extend to 3D: operator()(Facet const &)

Class partial_grid_morphism

Implement inverse morphism for the 3D case (inherit from base::inverse_type

Class partial_multi_grid_function

Extend to 3D: operator()(Facet const &)

Class transformed_geom

Extend approach to yield transformed (i.e., curved) segments, polygons etc.

Class vertex_morphism

Specialize if both grids have consecutive handles

Make it independent of element being a vertex type (using map_element_iter_name<> like in partial_grid_function)

Can temporary vertex objects be avoided?

make

morphism[Vertex] = Vertex 

possible (currently assignment possible only for vertex_handle)

Class vertex_set

specialize to vertex set of edges

Class vertex_set_of_cells_iterator

shallow copy / copy-on-write

Class vertex_set_of_facets_iterator

shallow copy / copy-on-write

File enlarge-grid.h

EnlargeGrid() , EnlargeGridV() can be defined fully generically in terms of EnlargeGridVC()

Member incident(E1 const &e1, E2 const &e2)

Tests

branch on iterator capabilities: Use either E1OnE2Iter or E2OnE1Iter.

Member calculate_vertex_stars(GRID const &G, GERMS &germs)

Works only for 2D meshes.

Group incidence_hull

Document the functions

Implement test cases and demos

Write more user-friendly wrappers to the mark_xxx routines.

Group gridboundingbox

routines should check at compile time whether geometries are linear.

Member get_grid_bounding_box(GRID const &G, GEOM const &Geom)

Specialize to the case that there is a boundary representation of the grid available. (The bounding box of a grid is that of the grid's boundary.)

Group boundarycompiter

A 3D analogue requires more work, as the boundary isn't linearly ordered any more.

Could use partial specialization based on the dimension of Grid to remove the syntactic 2D dependency in the name.

Group enumsubranges

the ranges do not allow ElementIterator(Range) constructor.

Group boundaryalgorithms

The algorithms could take an additional parameter IsOnBd which is a predicate deciding whether a Facet is on the boundary. Then one could handle also internal boundaries, for example between two partitions.

---

Copyright (c) Guntram Berti 1997-2002. See the GrAL Homepage for up-to-date information.

---