#include <rm3_SPQR_tree.h>
Definition at line 234 of file rm3_SPQR_tree.h.
split_component::split_component | ( | ) | [protected] |
split_component::split_component | ( | const split_component & | ) | [protected] |
split_component::~split_component | ( | ) |
split_component::split_component | ( | plan_undi_graph & | pug | ) |
split_component& split_component::operator= | ( | const split_component & | ) | [protected] |
Split gdtedge with a new gdtnode with identifier new_id, and return such gdtnode.
Reimplemented from plan_undi_graph.
gdtedge split_component::new_edge | ( | gdtnode | v1, | |
gdtnode | v2, | |||
face | f, | |||
int | new_id = AUTO_ID | |||
) | [protected] |
Insert a new undirected gdtedge with source v1 and terget v2, and id new_id, by splitting face f, and return it. PRECONDITIONS: both v1 and v2 belongs to f.
Reimplemented from plan_undi_graph.
void split_component::del_node | ( | gdtnode | v | ) | [protected] |
Delete gdtnode and return the face obtained by recursively merging the faces of the deleted edges.
Reimplemented from plan_undi_graph.
void split_component::del_edge | ( | gdtedge | e | ) | [protected] |
Delete gdtedge and return the face obtained by merging the two previous faces of the deleted gdtedge.
Reimplemented from plan_undi_graph.
gdt::gdtlist<split_component*> split_component::decomposition_in_triconnected_components | ( | ) | [protected] |
split_component& split_component::operator= | ( | plan_undi_graph & | ) |
void split_component::local_get | ( | plan_undi_graph *& | , | |
split_component_type & | , | |||
gdt::gdtnode_map< bool > *& | , | |||
gdt::gdtlist< separation_pair > *& | , | |||
gdt::gdtnode_map< struct_split_node_info > *& | , | |||
gdt::gdtedge_map< struct_split_edge_info > *& | ||||
) |
plan_undi_graph& split_component::get_owner_graph | ( | ) | const |
split_component_type split_component::get_type | ( | ) | const |
split_component_edge_type split_component::get_type_of_edge | ( | gdtedge | e | ) | const |
split_component* split_component::get_twin_edge_owner_split_component | ( | gdtedge | e | ) | const |
gdt::gdtlist<separation_pair> split_component::get_separation_pairs | ( | ) | const |
bool split_component::get_node_is_present | ( | gdtnode | v | ) | const |
bool split_component::contain_separation_pair | ( | separation_pair | sp | ) | const |
void split_component::clear | ( | ) |
void split_component::mirror | ( | split_component & | ) |
void split_component::forget | ( | ) |
Cut all private variables in *this.
Reimplemented from plan_undi_graph.
bool split_component::split_on_separation_pair | ( | separation_pair | sp, | |
split_component *& | sc1_pointer, | |||
int | new_id = AUTO_ID | |||
) |
bool split_component::merge_with_polygon_on_edge | ( | split_component *& | sc1_pointer, | |
gdtedge | e | |||
) |
gdt::gdtlist<split_component*> split_component::decompose_into_triconnected_components | ( | ) |
void split_component::print | ( | print_mode | mode = BY_FACES , |
|
bool | split_component_information = true , |
|||
std::ostream & | os = std::cout | |||
) |
Reimplemented in skeleton.
friend class skeleton [friend] |
Definition at line 237 of file rm3_SPQR_tree.h.