Inheritance Graph
graph BT
Delaunay2d
click Delaunay2d "classMinSG_1_1Triangulation_1_1Delaunay2d"
Description
Delaunay2d The implementation is based on the Java applet ‘2D Delaunay Triangulation Java Applet’ by Luke Sunder Parige (parige@ews.uiuc.edu) dated August 10, 1999.
See also: http://members.fortunecity.com/lukesunder/dt2d.htm
Classes
Public Types
|
|
|
|
typedef std::function< void(const Point_t &, const Point_t &, const Point_t &)> |
generatorFunction_t Function expecting a triangle consisting of three points. |
Public Functions
Documentation
typedef
MinSG::Triangulation::Delaunay2d::generatorFunction_t
|
|
typedef std::function< void(const Point_t &, const Point_t &, const Point_t &)> generatorFunction_t |
Function expecting a triangle consisting of three points.
Defined in MinSG/Ext/Triangulation/Delaunay2d.h:85
function
MinSG::Triangulation::Delaunay2d::Delaunay2d
Defined in MinSG/Ext/Triangulation/Delaunay2d.h:107
function
MinSG::Triangulation::Delaunay2d::addPoint
Add a point to the triangulation.
Note: only the x and y component of the point’s position are used.
Defined in MinSG/Ext/Triangulation/Delaunay2d.h:112
function
MinSG::Triangulation::Delaunay2d::generate
Call the given functor for every triangle.
Parameters
- generator
- Functor that will be called for every triangle
Defined in MinSG/Ext/Triangulation/Delaunay2d.h:122