![]() |
![]() |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Index C++ Code Documentation geom::surface0::Boundary Derived from: geom::surface0::SurfaceBase Children: geom::surface0::Normal File: GEOM/geom/surface0/Boundary.H Boundary connectivity information. An element of an EdgeMap represents an edge and is of the form { (i,j), {f0,f1,...} }. (i,j) represents an edge, and F = {f0,f1,...} a list of faces adjacent to the edge. length(F) is normally either 1 (boundary edge) or 2 (interior edge). compute_line_boundary() Computes _boundary, indices into _vertex making up the surface boundary. Each pair of unsigned ints represents a line segment. Algorithm: call compute_edge(). Put all edges with count=1 into _boundary compute_adjacency_list() Computes _adjacency_list. _adjacency_list[i] is a list of the vertices adjacent to i compute_edge() Compute a list of edges and the faces they bound. compute an associative array of edges, together with a list of the faces of which they are edges algorithm: cycle through all the faces, making a hash of all edges every time an edge occurs in a face, increment a counter. note: this could possibly be done with a hash rather than a map, but a hash function wants a number-like key. Here a pair of ints is the key note: this could possibly be done with a set, by counting occurences of edges only mod 2. This would assume that each edge occurs in at most 2 faces compute_pushoff() computes _pushoff, a lookup table each edge vertices to an adjacent interior vertex. Used for mean/gaussian curvature If i is an interior point, _pushoff[i] is set to INTERIOR_POINT If i is a boundary point, _pushoff[i] is set to the index of an adjacent interior point (if one exists) If no adjacent interior point exists, _pusoff[i] is set to UNKNOWN _pushoff is for coloring edges by gaussian/mean curvature via adjacent interior points NOTE: Each boundary vertex occurs in two boundary edges, so this inefficiently computes pushoff's twice for each boundary vertex public:
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|