CGAL 5.1.5 - Surface Mesh Topology
Namespaces | Classes | Enumerations | Functions
CGAL Namespace Reference

Namespaces

 collect_garbage_internal
 
 Surface_mesh_topology
 

Classes

class  Cell_attribute
 
class  Cell_attribute_with_id
 
class  Cell_attribute_with_point
 
class  Cell_attribute_with_point_and_id
 
class  Combinatorial_map
 
struct  Combinatorial_map_min_items
 
struct  Dart
 
class  Dual
 
struct  dynamic_edge_property_t
 
struct  dynamic_face_property_t
 
struct  dynamic_halfedge_property_t
 
struct  dynamic_vertex_property_t
 
class  Face_around_face_circulator
 
class  Face_around_face_iterator
 
class  Face_around_target_circulator
 
class  Face_around_target_iterator
 
struct  Face_filtered_graph
 
class  Generalized_map
 
struct  Generic_map_min_items
 
struct  graph_has_property
 
struct  Graph_with_descriptor_with_graph
 
struct  Graph_with_descriptor_with_graph_property_map
 
class  Halfedge_around_face_circulator
 
class  Halfedge_around_face_iterator
 
class  Halfedge_around_source_circulator
 
class  Halfedge_around_source_iterator
 
class  Halfedge_around_target_circulator
 
class  Halfedge_around_target_iterator
 
class  HalfedgeDS_face_max_base_with_id
 
class  HalfedgeDS_halfedge_max_base_with_id
 
class  HalfedgeDS_vertex_max_base_with_id
 
class  Linear_cell_complex
 
struct  Linear_cell_complex_bgl_min_items
 
struct  Linear_cell_complex_for_bgl_combinatorial_map_helper
 
class  Linear_cell_complex_for_combinatorial_map
 
class  Linear_cell_complex_for_generalized_map
 
struct  Linear_cell_complex_min_items
 
struct  Linear_cell_complex_traits
 
class  Polyhedron_3
 
class  Polyhedron_incremental_builder_3
 
class  Polyhedron_items_3
 
class  Polyhedron_items_with_id_3
 
class  Polyhedron_min_items_3
 
class  Polyhedron_traits_3
 
class  Polyhedron_traits_with_normals_3
 
class  Seam_mesh
 
class  Surface_mesh
 
class  Triangulation_face_base_with_id_2
 
class  Triangulation_vertex_base_with_id_2
 
class  Vertex_around_face_iterator
 
class  Vertex_around_target_circulator
 
class  Vertex_around_target_iterator
 

Enumerations

enum  vertex_index_t
 
enum  halfedge_index_t
 
enum  edge_index_t
 
enum  face_index_t
 
enum  vertex_point_t
 

Functions

CMap::Dart_handle make_combinatorial_hexahedron (CMap &cm)
 
CMap::Dart_handle make_combinatorial_polygon (CMap &cm, unsigned int lg)
 
CMap::Dart_handle make_combinatorial_tetrahedron (CMap &cm)
 
CMap::Dart_handle make_edge (CMap &cm)
 
CMap::Dart_handle insert_cell_0_in_cell_1 (CMap &cm, typename CMap::Dart_handle dh)
 
CMap::Dart_handle insert_cell_0_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
 
CMap::Dart_handle insert_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh1, typename CMap::Dart_handle dh2)
 
CMap::Dart_handle insert_cell_2_in_cell_3 (CMap &cm, InputIterator afirst, InputIterator alast)
 
CMap::Dart_handle insert_dangling_cell_1_in_cell_2 (CMap &cm, typename CMap::Dart_handle dh)
 
bool is_insertable_cell_1_in_cell_2 (const CMap &cm, typename CMap::Dart_const_handle dh1, typename CMap::Dart_const_handle dh2)
 
bool is_insertable_cell_2_in_cell_3 (const CMap &cm, InputIterator afirst, InputIterator alast)
 
bool is_removable (const CMap &cm, typename CMap::Dart_const_handle dh)
 
CMap::size_type remove_cell (CMap &cm, typename CMap::Dart_handle dh)
 
void draw (const LCC &alcc)
 
LCC::Dart_handle import_from_plane_graph (LCC &lcc, std::istream &ais)
 
LCC::Vector compute_normal_of_cell_0 (const LCC &lcc, typename LCC::Dart_const_handle dh)
 
LCC::Vector compute_normal_of_cell_2 (const LCC &lcc, typename LCC::Dart_const_handle dh)
 
LCC::Dart_handle import_from_polyhedron_3 (LCC &lcc, const Polyhedron &apoly)
 
LCC::Dart_handle import_from_triangulation_3 (LCC &lcc, const Triangulation_ &atr)
 
void set_halfedgeds_items_id (Polyhedron_with_id &P)
 
void set_triangulation_ids (Triangulation &tr)
 
Iterator_range< Halfedge_around_source_iterator< Graph > > halfedges_around_source (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Halfedge_around_source_iterator< Graph > > halfedges_around_source (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g)
 
Iterator_range< Halfedge_around_target_iterator< Graph > > halfedges_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Halfedge_around_target_iterator< Graph > > halfedges_around_target (typename boost::graph_traits< Graph >::vertex_descriptor v, const Graph &g)
 
Iterator_range< Halfedge_around_face_iterator< Graph > > halfedges_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Face_around_target_iterator< Graph > > faces_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Face_around_face_iterator< Graph > > faces_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Vertex_around_target_iterator< Graph > > vertices_around_target (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
Iterator_range< Vertex_around_face_iterator< Graph > > vertices_around_face (typename boost::graph_traits< Graph >::halfedge_descriptor h, const Graph &g)
 
bool is_border (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_border_edge (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_border (typename boost::graph_traits< FaceGraph >::edge_descriptor ed, const FaceGraph &g)
 
boost::optional< typename boost::graph_traits< FaceGraph >::halfedge_descriptor > is_border (typename boost::graph_traits< FaceGraph >::vertex_descriptor vd, const FaceGraph &g)
 
bool is_closed (const FaceGraph &g)
 
bool is_bivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_bivalent_mesh (const FaceGraph &g)
 
bool is_trivalent (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_trivalent_mesh (const FaceGraph &g)
 
bool is_isolated_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_triangle (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_triangle_mesh (const FaceGraph &g)
 
bool is_isolated_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_quad (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_quad_mesh (const FaceGraph &g)
 
bool is_tetrahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
bool is_valid_halfedge_graph (const Graph &g, bool verb=false)
 
bool is_valid_face_graph (const Graph &g, bool verb=false)
 
bool is_valid_polygon_mesh (const Mesh &g, bool verb=false)
 
bool is_hexahedron (typename boost::graph_traits< FaceGraph >::halfedge_descriptor hd, const FaceGraph &g)
 
void clear (FaceGraph &g)
 
bool is_empty (const FaceGraph &g)
 
int vertex_index_in_face (const typename boost::graph_traits< Graph >::vertex_descriptor vd, const typename boost::graph_traits< Graph >::face_descriptor fd, const Graph &g)
 
int halfedge_index_in_face (typename boost::graph_traits< Graph >::halfedge_descriptor he, const Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_triangle (const P &p0, const P &p1, const P &p2, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_quad (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_hexahedron (const P &p0, const P &p1, const P &p2, const P &p3, const P &p4, const P &p5, const P &p6, const P &p7, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_tetrahedron (const P &p0, const P &p1, const P &p2, const P &p3, Graph &g)
 
boost::graph_traits< Graph >::halfedge_descriptor make_regular_prism (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true)
 
boost::graph_traits< Graph >::halfedge_descriptor make_pyramid (typename boost::graph_traits< Graph >::vertices_size_type nb_vertices, Graph &g, const P &base_center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT height=1.0, typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0, bool is_closed=true)
 
boost::graph_traits< Graph >::halfedge_descriptor make_icosahedron (Graph &g, const P &center=P(0, 0, 0), typename CGAL::Kernel_traits< P >::Kernel::FT radius=1.0)
 
boost::graph_traits< Graph >::halfedge_descriptor make_grid (typename boost::graph_traits< Graph >::vertices_size_type i, typename boost::graph_traits< Graph >::vertices_size_type j, Graph &g, const CoordinateFunctor &calculator, bool triangulated=false)
 
OutputIterator expand_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_face_selection (const FaceRange &selection, FaceGraph &fg, unsigned int k, IsFaceSelectedPMap is_selected, OutputIterator out)
 
void regularize_face_selection_borders (TriangleMesh &mesh, IsSelectedMap is_selected, double weight, const NamedParameters &np)
 
OutputIterator select_incident_faces (const HalfedgeRange &hedges, FaceGraph &fg, OutputIterator out)
 
OutputIterator expand_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_edge_selection (const EdgeRange &selection, HalfedgeGraph &fg, unsigned int k, IsEdgeSelectedPMap is_selected, OutputIterator out)
 
OutputIterator expand_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out)
 
OutputIterator reduce_vertex_selection (const VertexRange &selection, HalfedgeGraph &fg, unsigned int k, IsVertexSelectedPMap is_selected, OutputIterator out)
 
void expand_face_selection_for_removal (const FaceRange &faces_to_be_deleted, TriangleMesh &tm, IsSelectedMap is_selected)
 
void split_graph_into_polylines (const Graph &graph, Visitor &polyline_visitor, IsTerminal is_terminal)
 
void copy_face_graph (const SourceMesh &sm, TargetMesh &tm, const NamedParameters1 &np1, const NamedParameters2 &np2)
 
bool write_wrl (std::ostream &os, const FaceGraph &g, const NamedParameters &np)
 
bool write_off (std::ostream &os, const FaceGraph &g, const NamedParameters &np)
 
bool write_off (const char *fname, const FaceGraph &g, const NamedParameters &np)
 
bool read_off (std::istream &is, FaceGraph &g, NamedParameters np)
 
bool read_off (const char *fname, FaceGraph &g, NamedParameters np)
 
void write_vtp (std::ostream &os, const TriangleMesh &mesh, const NamedParameters &np)
 
double alpha_expansion_graphcut (const InputGraph &input_graph, EdgeCostMap edge_cost_map, VertexLabelCostMap vertex_label_cost_map, VertexLabelMap vertex_label_map, const NamedParameters &np)
 
bool read_off (Surface_mesh< K > &mesh, const std::string &filename)
 
bool write_off (const Surface_mesh< K > &mesh, const std::string &filename)
 
bool read_mesh (Surface_mesh< K > &mesh, const std::string &filename)
 
bool write_mesh (const Surface_mesh< K > &mesh, const std::string &filename)
 
void generic_print_surface_mesh (std::ostream &out, const Surface_mesh< P > &M, Writer &writer)
 
int read_3mf (const std::string &file_name, std::vector< CGAL::Surface_mesh< Point > > &output)
 
bool write_off (std::ostream &os, const Surface_mesh< P > &sm)
 
bool read_off (std::istream &is, Surface_mesh< P > &sm)
 
void draw (const POLY &apoly)
 
template<class Mesh >
void draw (const Mesh &amesh, const std::vector< Path_on_surface< Mesh > > &apaths)
 opens a new window and draws amesh, either a 2D linear cell complex or a model of the FaceGraph concept, plus the paths lying on this mesh given in apaths. More...
 
template<class Mesh >
void draw (const Mesh &amesh, std::initializer_list< Path_on_surface< Mesh > > &apaths)
 opens a new window and draws amesh, either a 2D linear cell complex or a model of the FaceGraph concept, plus the paths lying on this mesh given in apaths. More...