|
Graphite Version 3
An experimental 3D geometry processing program
|
This is the complete list of members for GEO::RegularWeightedDelaunay2d, including all inherited members.
| abort_if_empty_cell(bool x) | GEO::Delaunay2d | inline |
| add_triangle_to_list(index_t t, index_t &first, index_t &last) | GEO::Delaunay2d | inlineprotected |
| adjacent_index(index_t c1, index_t c2) const | GEO::Delaunay | inline |
| cell_adjacent(index_t c, index_t lf) const | GEO::Delaunay | inline |
| cell_is_finite(index_t c) const | GEO::Delaunay | inline |
| cell_is_infinite(index_t c) const | GEO::Delaunay | |
| cell_neigh_stride_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| cell_size() const | GEO::Delaunay | inline |
| cell_size_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| cell_to_cell() const | GEO::Delaunay | inline |
| cell_to_cell_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| cell_to_v() const | GEO::Delaunay | inline |
| cell_to_v_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| cell_v_stride_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| cell_vertex(index_t c, index_t lv) const | GEO::Delaunay | inline |
| check_combinatorics(bool verbose=false) const | GEO::Delaunay2d | protected |
| check_geometry(bool verbose=false) const | GEO::Delaunay2d | protected |
| cicl_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| clear_neighbors() | GEO::Delaunay | inline |
| constraints() const | GEO::Delaunay | inline |
| constraints_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| Counted() | GEO::Counted | inlineprotected |
| create(coord_index_t dim, const std::string &name="default") | GEO::Delaunay | static |
| create_first_triangle(index_t &iv0, index_t &iv1, index_t &iv2) | GEO::Delaunay2d | protected |
| default_nb_neighbors() const | GEO::Delaunay | inline |
| default_nb_neighbors_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| Delaunay(coord_index_t dimension) | GEO::Delaunay | protected |
| Delaunay2d(coord_index_t dimension=2) | GEO::Delaunay2d | |
| Delaunay_var typedef | GEO::Delaunay | related |
| DelaunayFactory typedef | GEO::Delaunay | related |
| dimension() const | GEO::Delaunay | inline |
| dimension_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| do_reorder_ | GEO::Delaunay | protected |
| END_OF_LIST | GEO::Delaunay2d | protectedstatic |
| find_3(const signed_index_t *T, signed_index_t v) | GEO::Delaunay2d | inlineprotectedstatic |
| find_conflict_zone(index_t v, index_t t, const Sign *orient, index_t &t_bndry, index_t &e_bndry, index_t &first, index_t &last) | GEO::Delaunay2d | protected |
| find_conflict_zone_iterative(const double *p, index_t t, index_t &t_bndry, index_t &e_bndry, index_t &first, index_t &last) | GEO::Delaunay2d | protected |
| find_triangle_adjacent(index_t t1, index_t t2_in) const | GEO::Delaunay2d | inlineprotected |
| find_triangle_vertex(index_t t, signed_index_t v) const | GEO::Delaunay2d | inlineprotected |
| finite_triangle_vertex(index_t t, index_t lv) const | GEO::Delaunay2d | inlineprotected |
| get_neighbors(index_t v, vector< index_t > &neighbors) const | GEO::Delaunay | inline |
| get_neighbors_internal(index_t v, vector< index_t > &neighbors) const | GEO::Delaunay | protectedvirtual |
| get_refine() const | GEO::Delaunay | inline |
| has_empty_cells() const | GEO::Delaunay2d | inline |
| index(index_t c, signed_index_t v) const | GEO::Delaunay | inline |
| initialize() | GEO::Delaunay | static |
| insert(index_t v, index_t hint=NO_TRIANGLE) | GEO::Delaunay2d | protected |
| is_locked_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| is_shared() const | GEO::Counted | inline |
| keep_infinite_ | GEO::Delaunay | protected |
| keep_regions_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| keeps_infinite() const | GEO::Delaunay | inline |
| locate(const double *p, index_t hint=NO_TRIANGLE, bool thread_safe=false, Sign *orient=nullptr) const | GEO::Delaunay2d | protected |
| locate_inexact(const double *p, index_t hint, index_t max_iter) const | GEO::Delaunay2d | protected |
| mark_triangle(index_t t) | GEO::Delaunay2d | inlineprotected |
| max_t() const | GEO::Delaunay2d | inlineprotected |
| nb_cells() const | GEO::Delaunay | inline |
| nb_cells_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| nb_finite_cells() const | GEO::Delaunay | inline |
| nb_finite_cells_ | GEO::Delaunay | protected |
| nb_refs() const | GEO::Counted | inline |
| nb_vertices() const | GEO::Delaunay | inline |
| nb_vertices_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| nearest_vertex(const double *p) const override | GEO::Delaunay2d | virtual |
| neighbors_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| new_triangle() | GEO::Delaunay2d | inlineprotected |
| new_triangle(signed_index_t v1, signed_index_t v2, signed_index_t v3) | GEO::Delaunay2d | inlineprotected |
| next_around_vertex(index_t c, index_t lv) const | GEO::Delaunay | inline |
| NO_TRIANGLE | GEO::Delaunay2d | protectedstatic |
| NOT_IN_LIST | GEO::Delaunay2d | protectedstatic |
| NOT_IN_LIST_BIT | GEO::Delaunay2d | protectedstatic |
| quality_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| ref() const | GEO::Counted | inline |
| ref(const Counted *counted) | GEO::Counted | inlinestatic |
| refine_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| region(index_t t) const | GEO::Delaunay | virtual |
| RegularWeightedDelaunay2d(coord_index_t dimension=3) | GEO::RegularWeightedDelaunay2d | |
| remove_triangle_from_list(index_t t) | GEO::Delaunay2d | inlineprotected |
| save_histogram(std::ostream &out) const | GEO::Delaunay | |
| set_arrays(index_t nb_cells, const signed_index_t *cell_to_v, const signed_index_t *cell_to_cell) | GEO::Delaunay | protectedvirtual |
| set_BRIO_levels(const vector< index_t > &levels) | GEO::Delaunay | virtual |
| set_constraints(const Mesh *mesh) | GEO::Delaunay | inlinevirtual |
| set_default_nb_neighbors(index_t x) | GEO::Delaunay | inline |
| set_dimension(coord_index_t dim) | GEO::Delaunay | inlineprotected |
| set_keep_regions(bool x) | GEO::Delaunay | inline |
| set_keeps_infinite(bool x) | GEO::Delaunay | inline |
| set_next_around_vertex(index_t c1, index_t lv, index_t c2) | GEO::Delaunay | inlineprotected |
| set_quality(double qual) | GEO::Delaunay | inline |
| set_refine(bool x) | GEO::Delaunay | inline |
| set_reorder(bool x) | GEO::Delaunay | inline |
| set_stores_cicl(bool x) | GEO::Delaunay | inline |
| set_stores_neighbors(bool x) | GEO::Delaunay | inline |
| set_tet(index_t t, signed_index_t v0, signed_index_t v1, signed_index_t v2, index_t a0, index_t a1, index_t a2) | GEO::Delaunay2d | inlineprotected |
| set_thread_safe(bool x) | GEO::Delaunay | inline |
| set_triangle_adjacent(index_t t1, index_t le1, index_t t2) | GEO::Delaunay2d | inlineprotected |
| set_triangle_mark_stamp(index_t stamp) | GEO::Delaunay2d | inlineprotected |
| set_triangle_vertex(index_t t, index_t lv, signed_index_t v) | GEO::Delaunay2d | inlineprotected |
| set_vertices(index_t nb_vertices, const double *vertices) override | GEO::Delaunay2d | virtual |
| show_list(index_t first, const std::string &list_name) const | GEO::Delaunay2d | protected |
| show_triangle(index_t t) const | GEO::Delaunay2d | protected |
| show_triangle_adjacent(index_t t, index_t le) const | GEO::Delaunay2d | protected |
| stellate_conflict_zone(index_t v, index_t t_bndry, index_t e_bndry) | GEO::Delaunay2d | protected |
| store_cicl_ | GEO::Delaunay | protected |
| store_neighbors_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| store_neighbors_CB(index_t i) | GEO::Delaunay | virtual |
| stores_cicl() const | GEO::Delaunay | inline |
| stores_neighbors() const | GEO::Delaunay | inline |
| supports_constraints() const | GEO::Delaunay | virtual |
| thread_safe() const | GEO::Delaunay | inline |
| triangle_adjacent(index_t t, index_t le) const | GEO::Delaunay2d | inlineprotected |
| triangle_edge_vertex(index_t e, index_t v) | GEO::Delaunay2d | inlineprotectedstatic |
| triangle_is_conflict(index_t t, const double *p) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_finite(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_free(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_in_list(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_marked(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_real(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_is_virtual(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_next(index_t t) const | GEO::Delaunay2d | inlineprotected |
| triangle_vertex(index_t t, index_t lv) const | GEO::Delaunay2d | inlineprotected |
| unref() const | GEO::Counted | inline |
| unref(const Counted *counted) | GEO::Counted | inlinestatic |
| update_cicl() | GEO::Delaunay | protectedvirtual |
| update_neighbors() | GEO::Delaunay | protectedvirtual |
| update_v_to_cell() | GEO::Delaunay | protectedvirtual |
| v_to_cell_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| VERTEX_AT_INFINITY | GEO::Delaunay2d | protectedstatic |
| vertex_cell(index_t v) const | GEO::Delaunay | inline |
| vertex_ptr(index_t i) const | GEO::Delaunay | inline |
| vertex_stride_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| vertices_ (defined in GEO::Delaunay) | GEO::Delaunay | protected |
| vertices_ptr() const | GEO::Delaunay | inline |
| ~Counted() | GEO::Counted | protectedvirtual |
| ~Delaunay() override | GEO::Delaunay | protected |
| ~Delaunay2d() override | GEO::Delaunay2d | protected |
| ~RegularWeightedDelaunay2d() override | GEO::RegularWeightedDelaunay2d | protected |