Delaunay2 Class Reference
2D Delaunay triangulation, using Jonathan Richard Shewchuk's "triangle" implementation. More...
#include <easy3d/algo/delaunay_2d.h>
Inheritance diagram for Delaunay2:
Public Member Functions | |
| void | set_vertices (unsigned int nb_vertices, const float *pts) override |
| Sets the vertices from an array of floating point numbers in which each consecutive number pair denotes a 2D point. More... | |
| void | set_vertices (const std::vector< vec2 > &vertices) |
| Sets the vertices from an array of 2D points. | |
| unsigned int | nearest_vertex (const float *p) const override |
| unsigned int | nearest_vertex (const vec2 &p) const |
| const vec2 & | vertex (unsigned int i) const |
| const int * | tri_to_v () const |
| const int * | tri_to_tri () const |
| int | vertex_tri (int v) const |
| unsigned int | nb_triangles () const |
| Returns the number of triangles. | |
| int | tri_vertex (unsigned int t, unsigned int lv) const |
Returns the index of the lv_th vertex in the t_th triangle. | |
| int | tri_adjacent (unsigned int t, unsigned int le) const |
 Public Member Functions inherited from Delaunay | |
| Delaunay (unsigned int dimension) | |
| Constructor. More... | |
| unsigned int | dimension () const |
| Returns the dimension. | |
| unsigned int | cell_size () const |
| Returns the size of the cell. | |
| virtual void | set_vertices (unsigned int nb_vertices, const float *vertices) |
| Sets the vertices. More... | |
| const float * | vertices_ptr () const |
| Returns the pointer to the vertices. | |
| const float * | vertex_ptr (unsigned int i) const |
Returns the pointer to the vertex of index i. | |
| unsigned int | nb_vertices () const |
| Returns the number of vertices. | |
| unsigned int | nb_cells () const |
| Returns the number of cells. | |
| const int * | cell_to_v () const |
| const int * | cell_to_cell () const |
| virtual unsigned int | nearest_vertex (const float *p) const |
| int | cell_vertex (unsigned int c, unsigned int lv) const |
Returns the index of the lv_th vertex in the c_th cell. | |
| int | cell_adjacent (unsigned int c, unsigned int lf) const |
| int | vertex_cell (unsigned int v) const |
| unsigned int | index (unsigned int c, int v) const |
| unsigned int | adjacent_index (unsigned int c1, unsigned int c2) const |
| unsigned int | next_around_vertex (unsigned int c, unsigned int lv) const |
| virtual void | get_neighbors (unsigned int v, std::vector< unsigned int > &neighbors) const |
| Retrieves the one-ring neighbors of vertex v. | |
| bool | check_duplicate_vertices () |
| Checks for duplicate vertices in stored neighbor lists. Returns true if there where some duplicate vertices. | |
Detailed Description
2D Delaunay triangulation, using Jonathan Richard Shewchuk's "triangle" implementation.
Member Function Documentation
◆ nearest_vertex()
|
inlineoverridevirtual |
Reimplemented from Delaunay.
◆ set_vertices()
|
overridevirtual |
Sets the vertices from an array of floating point numbers in which each consecutive number pair denotes a 2D point.
Reimplemented from Delaunay.
The documentation for this class was generated from the following files:
- /Users/lnan/Documents/Projects/Easy3D/easy3d/algo/delaunay_2d.h
- /Users/lnan/Documents/Projects/Easy3D/easy3d/algo/delaunay_2d.cpp
