|
| bool | ug::CollectSurfaceNeighborsSorted (std::vector< Vertex * > &vNeighborsOut, Grid &grid, Vertex *v) |
| | Collects neighbor-vertices in either clockwise or counter clockwise order.
|
| |
| Vertex * | ug::FindVertexByCoordiante (vector3 &coord, VertexIterator iterBegin, VertexIterator iterEnd, Grid::VertexAttachmentAccessor< APosition > &aaPos) |
| | returns the vertex that is the closest to the given coordinate
|
| |
| Edge * | ug::GetConnectedEdge (Grid &g, Vertex *vrt, Face *tri) |
| | returns the edge in the triangle tri, which does not contain vrt.
|
| |
| Vertex * | ug::GetConnectedVertex (Edge *e, Vertex *v) |
| | returns the vertex that is connected to v via e.
|
| |
| Vertex * | ug::GetConnectedVertex (EdgeVertices *e, Face *f) |
| | returns the index of the first vertex that is contained in f and is not contained in e.
|
| |
| int | ug::GetConnectedVertexIndex (Face *f, const EdgeDescriptor &ed) |
| | returns the index of the first vertex that is contained in the specified face and is not contained in the given edge.
|
| |
| int | ug::GetConnectedVertexIndex (Face *f, const EdgeVertices *e) |
| |
| Vertex * | ug::GetSharedVertex (IVertexGroup *vrts0, IVertexGroup *vrts1) |
| | returns the first vertex of vrts0 that is also contained in vrts1 (or NULL if no such vertex exists)
|
| |
| size_t | ug::GetSharedVertices (std::vector< Vertex * > &vrtsOut, IVertexGroup *vrts0, IVertexGroup *vrts1) |
| | fills a vector with the vertices that are both contained in vrts0 and vrts1.
|
| |
| int | ug::GetVertexIndex (EdgeVertices *e, Vertex *v) |
| | returns the index at which vertex v is found in the given edge
|
| |
| int | ug::GetVertexIndex (FaceVertices *f, Vertex *v) |
| | returns the index at which vertex v is found in the given face
|
| |
| int | ug::GetVertexIndex (VolumeVertices *vol, Vertex *v) |
| | returns the index at which vertex v is found in the given volume
|
| |
| bool | ug::IsBoundaryVertex1D (Grid &grid, Vertex *v, Grid::edge_traits::callback cbConsiderEdge=ConsiderAll()) |
| | returns whether a vertex lies on the boundary of a polygonal chain.
|
| |
| bool | ug::IsBoundaryVertex2D (Grid &grid, Vertex *v) |
| | returns whether a vertex lies on the boundary of a 2D grid.
|
| |
| bool | ug::IsBoundaryVertex3D (Grid &grid, Vertex *v) |
| | returns true if a vertex lies on the boundary of a 3D grid.
|
| |
| bool | ug::IsRegularSurfaceVertex (Grid &grid, Vertex *v) |
| | returns true if the vertex lies inside a regular surface
|
| |
| bool | ug::LiesOnBoundary (Grid &grid, Vertex *v) |
| | returns true, if the vertex lies on a 1d, 2d or 3d boundary
|
| |
| void | ug::MarkFixedCreaseVertices (Grid &grid, SubsetHandler &sh, int creaseSI, int fixedSI) |
| |
| void | ug::MergeVertices (Grid &grid, Vertex *v1, Vertex *v2) |
| | merges two vertices and restructures the adjacent elements.
|
| |
| int | ug::NumAssociatedEdges (Grid &grid, Vertex *v) |
| | returns the number of associated edges of the given vertex
|
| |
| int | ug::NumAssociatedFaces (Grid &grid, Vertex *v) |
| | returns the number of associated faces of the given vertex
|
| |
| size_t | ug::NumSharedVertices (IVertexGroup *vrts0, IVertexGroup *vrts1) |
| | Returns the number of shared vertices between vrts0 and vrts1.
|
| |
|
| bool | ug::CalculateVertexNormals (Grid &grid, APosition &aPos, ANormal &aNorm) |
| | calculates the normals of all vertices in grid and stores them in aNorm.
|
| |
| bool | ug::CalculateVertexNormals (Grid &grid, Grid::AttachmentAccessor< Vertex, APosition > &aaPos, Grid::AttachmentAccessor< Vertex, ANormal > &aaNorm) |
| | calculates the normals of all vertices in grid and stores them in aNorm.
|
| |
1.9.8