, including all inherited members.
| add_face_manager(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| add_face_to_mesh(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| add_face_to_mesh(CDT::Face_handle fti) | class_constrained_delaunay_triangulation | |
| add_point_cloud(const pcl::PointCloud< pcl::PointXYZRGB > *pc, std::vector< float > *vweight, int provenience) | class_constrained_delaunay_triangulation | |
| add_point_manager(double x, double y, double z, float rgb, float weight, int provenience) | class_constrained_delaunay_triangulation | |
| add_vertex_manager(double x, double y, double z, float rgb, float weight, int provenience) | class_constrained_delaunay_triangulation | |
| add_vertex_to_mesh(double x, double y, double z, float rgb, float weight, int provenience) | class_constrained_delaunay_triangulation | |
| are_there_at_least_two_vertices_with_equal_provenience_not_mine(Face_handle fh, int my_provenience) | class_constrained_delaunay_triangulation | |
| at_least_one_vertice_has_infinite_provenience(Face_handle fh) | class_constrained_delaunay_triangulation | |
| at_least_two_vertices_have_my_provenience(Face_handle fh, int my_provenience) | class_constrained_delaunay_triangulation | |
| check_if_face_should_be_inserted(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| class_constrained_delaunay_triangulation(void) | class_constrained_delaunay_triangulation | [inline] |
| cleanup_isolated_vertices(void) | class_constrained_delaunay_triangulation | |
| cleanup_neighbours(Vertex_handle1 vh) | class_constrained_delaunay_triangulation | |
| clear_constraints(void) | class_constrained_delaunay_triangulation | |
| clear_vertices(void) | class_constrained_delaunay_triangulation | |
| compute_union(void) | class_constrained_delaunay_triangulation | |
| debug | class_constrained_delaunay_triangulation | |
| discoverComponent(const CDT &ct, Face_handle start, int index, std::list< CDT::Edge > &border) | class_constrained_delaunay_triangulation | [private] |
| discoverComponents(const CDT &ct) | class_constrained_delaunay_triangulation | [private] |
| do_face_vertices_have_equal_provenience(Face_handle fh, int *provenience=NULL) | class_constrained_delaunay_triangulation | |
| dt | class_constrained_delaunay_triangulation | |
| equal(Point_2 p1, Point_2 p2) | class_constrained_delaunay_triangulation | |
| equal_e(CGAL::Point_2< K_exact > p1, CGAL::Point_2< K_exact > p2) | class_constrained_delaunay_triangulation | |
| export_all_points_to_pc(void) | class_constrained_delaunay_triangulation | |
| export_points_to_pc(void) | class_constrained_delaunay_triangulation | |
| face(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| face_max_weight(Face_handle fh) | class_constrained_delaunay_triangulation | |
| filter_isolated_vertexes(void) | class_constrained_delaunay_triangulation | |
| get_face_average_weight(Face_handle fh) | class_constrained_delaunay_triangulation | |
| get_face_handle_from_t_face(t_face *f) | class_constrained_delaunay_triangulation | |
| get_intersecting_faces_list(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| get_point_face_distances(double x, double y, Face_handle fh, double *dv0, double *dv1, double *dv2) | class_constrained_delaunay_triangulation | |
| get_point_face_proveniences(Face_handle fh, int *p0, int *p1, int *p2) | class_constrained_delaunay_triangulation | |
| get_seed_list_of_faces_for_tti(CDT::Face_handle fti, std::vector< CDT::Face_handle > *queue) | class_constrained_delaunay_triangulation | |
| get_vertex_at(Point_2 p) | class_constrained_delaunay_triangulation | |
| index_count | class_constrained_delaunay_triangulation | [private] |
| initialize_all_faces_status(void) | class_constrained_delaunay_triangulation | [inline, private] |
| initialize_visited(void) | class_constrained_delaunay_triangulation | [inline, private] |
| is_degenerate(double x0, double y0, double z0, double x1, double y1, double z1, double x2, double y2, double z2) | class_constrained_delaunay_triangulation | |
| iterate_intersecting_faces(CDT::Face_handle fti, int predicate_number) | class_constrained_delaunay_triangulation | |
| overlaps(Point_2 *v0, Point_2 *v1, Point_2 *v2, Point_2 *p) | class_constrained_delaunay_triangulation | |
| pc | class_constrained_delaunay_triangulation | |
| pc_constraints | class_constrained_delaunay_triangulation | |
| pc_faces_intersect | class_constrained_delaunay_triangulation | |
| pc_faces_visited | class_constrained_delaunay_triangulation | |
| pc_proveniences | class_constrained_delaunay_triangulation | |
| pc_vertices | class_constrained_delaunay_triangulation | |
| pc_vertices_indices | class_constrained_delaunay_triangulation | |
| pi | class_constrained_delaunay_triangulation | |
| predicate_remove_intersecting_constraints(CDT::Face_handle fti, CDT::Face_handle fh) | class_constrained_delaunay_triangulation | |
| predicate_remove_vertex(CDT::Face_handle fti, CDT::Face_handle fh) | class_constrained_delaunay_triangulation | |
| predicate_should_add_face(CDT::Face_handle fti, CDT::Face_handle fh) | class_constrained_delaunay_triangulation | [inline] |
| print_all_vertices(void) | class_constrained_delaunay_triangulation | |
| printf_face_info(CDT::Face_handle fh) | class_constrained_delaunay_triangulation | |
| project_triangulation_to_new_plane(pcl::ModelCoefficients::Ptr plane, tf::Transform tf) | class_constrained_delaunay_triangulation | |
| projection_union | class_constrained_delaunay_triangulation | |
| remove_constraint(CDT::Face_handle fh, int li) | class_constrained_delaunay_triangulation | |
| remove_face_vertexes_without_this_provenience(Face_handle fh, int provenience) | class_constrained_delaunay_triangulation | |
| remove_intersecting_constrained_edges(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| remove_vertices_inside_triangle(double x0, double y0, double z0, float rgb0, double x1, double y1, double z1, float rgb1, double x2, double y2, double z2, float rgb2, float face_weight, int provenience) | class_constrained_delaunay_triangulation | |
| segments_intersect_not_at_endpoints(CGAL::Segment_2< K_exact > seg1, CGAL::Segment_2< K_exact > seg2) | class_constrained_delaunay_triangulation | [private] |
| set_constraint_polygon(void) | class_constrained_delaunay_triangulation | |
| set_transform(tf::Transform *st) | class_constrained_delaunay_triangulation | |
| test_if_triangulation_is_valid(void) | class_constrained_delaunay_triangulation | |
| transform | class_constrained_delaunay_triangulation | |
| triangles_overlap(Point_2 t0_p0, Point_2 t0_p1, Point_2 t0_p2, Point_2 t1_p0, Point_2 t1_p1, Point_2 t1_p2) | class_constrained_delaunay_triangulation | |
| vector_faces | class_constrained_delaunay_triangulation | |
| ~class_constrained_delaunay_triangulation(void) | class_constrained_delaunay_triangulation | [inline] |
