Structural Bioinformatics Library
Template C++ / Python API for developping structural bioinformatics applications.
|
Defines simple predicates and constructions structure over a triangulation. More...
#include <Delaunay_triangulation_extension_3.hpp>
Classes | |
class | Get_area_of_dual_of_edge |
Given the dual of an edge, compute its area. More... | |
class | Get_dual_of_edge |
Given an edge, return its dual as a container of points. More... | |
class | Get_dual_of_facet |
Given a facet, return its dual as a segment. More... | |
class | Get_squared_length_of_dual_of_facet |
Given a facet, return the squared length of its dual segment. More... | |
Public Types | |
typedef DelaunayTriangulation3::Geom_traits | Geom_traits |
typedef Geom_traits::Kernel | Kernel |
typedef Kernel::Point_3 | Point_3 |
typedef Kernel::FT | FT |
Number type used for representing the 3D points. More... | |
typedef Kernel::Segment_3 | Segment_3 |
Representation of a 3D segment. More... | |
typedef DelaunayTriangulation3::Vertex_handle | Vertex_handle |
Representation of a vertex in the 3D Triangulation. More... | |
typedef DelaunayTriangulation3::Cell_handle | Cell_handle |
Representation of a cell in the 3D Triangulation. More... | |
typedef DelaunayTriangulation3::Edge | Edge |
Representation of an edge in the 3D Triangulation. More... | |
typedef DelaunayTriangulation3::Facet | Facet |
Representation of a facet in the 3D Triangulation. More... | |
Inheritence | |
typedef Base::Canonical_edge | Canonical_edge |
Canonical representation of an edge in the 3D Triangulation. More... | |
typedef Base::Canonical_facet | Canonical_facet |
Canonical representation of a facet in the 3D Triangulation. More... | |
typedef Base::Get_other_two_edges | Get_other_two_edges |
Given an edge and a facet bounding it, return the two other edges of the facet. More... | |
typedef Base::Get_common_facet | Get_common_facet |
Given two cells, return the common facet of the two cells. More... | |
typedef Base::Is_coface | Is_coface |
Check that a simplex is the coface of a second simplex. More... | |
typedef Base::Is_counter_clockwise_oriented | Is_counter_clockwise_oriented |
Predicate checking that a facet of the 3D triangulation is counter-clockwise oriented. More... | |
Defines simple predicates and constructions structure over a triangulation.
DelaunayTriangulation3 | A Model of the 3D Triangulation from the CGAL Library. |
typedef Base::Canonical_edge Canonical_edge |
Canonical representation of an edge in the 3D Triangulation.
It is a pair of vertices such that the first vertex compare less than the second one.
typedef Base::Canonical_facet Canonical_facet |
Canonical representation of a facet in the 3D Triangulation.
It is the same as Facet, but if the facet has two cofaces, its associated coface is the one that compares the lesser.
typedef DelaunayTriangulation3:: Cell_handle Cell_handle |
Representation of a cell in the 3D Triangulation.
More precisely, it is a pointer over a geometric and combinatorial data structure representing a tetrahedron of the triangulation. The cell is always associated to thhe four vertices bounding the tetrahedron.
typedef DelaunayTriangulation3::Edge Edge |
Representation of an edge in the 3D Triangulation.
It is a triple (Cell_handle, int, int), where the two integers are the indices of its source and target vertices in the associated cell.
typedef DelaunayTriangulation3::Facet Facet |
Representation of a facet in the 3D Triangulation.
It is a pair (Cell_handle, int), where the cell is a coface of the facet and the integer is the index of the vertex of the associated cell not in the facet.
typedef Kernel::FT FT |
Number type used for representing the 3D points.
Given two cells, return the common facet of the two cells.
Given an edge and a facet bounding it, return the two other edges of the facet.
typedef Base::Is_coface Is_coface |
Check that a simplex is the coface of a second simplex.
Predicate checking that a facet of the 3D triangulation is counter-clockwise oriented.
typedef Kernel::Segment_3 Segment_3 |
Representation of a 3D segment.
typedef DelaunayTriangulation3::Vertex_handle Vertex_handle |
Representation of a vertex in the 3D Triangulation.
More precisely, it is a pointer over a geometric and combinatorial data structure representing a point of the triangulation. The vertex is always associated to an incident tetrahedron of the triangulation.