#include <Subdivision2D.hpp>
◆ EdgeID
◆ VertexID
◆ Subdivision2D() [1/3]
SIV3D_NODISCARD_CXX20 s3d::Subdivision2D::Subdivision2D |
( |
| ) |
|
|
default |
◆ Subdivision2D() [2/3]
SIV3D_NODISCARD_CXX20 s3d::Subdivision2D::Subdivision2D |
( |
const RectF & |
rect | ) |
|
|
explicit |
◆ Subdivision2D() [3/3]
SIV3D_NODISCARD_CXX20 s3d::Subdivision2D::Subdivision2D |
( |
const RectF & |
rect, |
|
|
const Array< Vec2 > & |
points |
|
) |
| |
|
explicit |
◆ addPoint()
int32 s3d::Subdivision2D::addPoint |
( |
const Vec2 & |
point | ) |
|
◆ addPoints()
void s3d::Subdivision2D::addPoints |
( |
const Array< Vec2 > & |
points | ) |
|
◆ calculateEdges() [1/2]
Array<Line> s3d::Subdivision2D::calculateEdges |
( |
| ) |
const |
◆ calculateEdges() [2/2]
void s3d::Subdivision2D::calculateEdges |
( |
Array< Line > & |
edgeList | ) |
const |
◆ calculateLeadingEdges() [1/2]
Array<EdgeID> s3d::Subdivision2D::calculateLeadingEdges |
( |
| ) |
const |
◆ calculateLeadingEdges() [2/2]
void s3d::Subdivision2D::calculateLeadingEdges |
( |
Array< EdgeID > & |
leadingEdgeList | ) |
const |
◆ calculateTriangles() [1/2]
◆ calculateTriangles() [2/2]
void s3d::Subdivision2D::calculateTriangles |
( |
Array< Triangle > & |
triangleList | ) |
const |
◆ calculateVoronoiFacets() [1/3]
◆ calculateVoronoiFacets() [2/3]
◆ calculateVoronoiFacets() [3/3]
◆ edgeBegin()
◆ edgeEnd()
◆ findNearest()
◆ getEdge()
◆ getVertex()
Vec2 s3d::Subdivision2D::getVertex |
( |
VertexID |
vertex, |
|
|
EdgeID * |
firstEdge = nullptr |
|
) |
| const |
◆ initDelaunay()
void s3d::Subdivision2D::initDelaunay |
( |
const RectF & |
rect | ) |
|
◆ isEmpty()
bool s3d::Subdivision2D::isEmpty |
( |
| ) |
const |
|
noexcept |
◆ nextEdge()
◆ operator bool()
s3d::Subdivision2D::operator bool |
( |
| ) |
const |
|
explicitnoexcept |
◆ rotateEdge()
◆ symEdge()
The documentation for this class was generated from the following file: