#include <imgproc.hpp>
|
enum | {
PTLOC_ERROR = -2,
PTLOC_OUTSIDE_RECT = -1,
PTLOC_INSIDE = 0,
PTLOC_VERTEX = 1,
PTLOC_ON_EDGE = 2
} |
|
enum | {
NEXT_AROUND_ORG = 0x00,
NEXT_AROUND_DST = 0x22,
PREV_AROUND_ORG = 0x11,
PREV_AROUND_DST = 0x33,
NEXT_AROUND_LEFT = 0x13,
NEXT_AROUND_RIGHT = 0x31,
PREV_AROUND_LEFT = 0x20,
PREV_AROUND_RIGHT = 0x02
} |
|
|
| Subdiv2D () |
|
| Subdiv2D (Rect rect) |
|
void | initDelaunay (Rect rect) |
|
int | insert (Point2f pt) |
|
void | insert (const vector< Point2f > &ptvec) |
|
int | locate (Point2f pt, CV_OUT int &edge, CV_OUT int &vertex) |
|
int | findNearest (Point2f pt, CV_OUT Point2f *nearestPt=0) |
|
void | getEdgeList (CV_OUT vector< Vec4f > &edgeList) const |
|
void | getTriangleList (CV_OUT vector< Vec6f > &triangleList) const |
|
void | getVoronoiFacetList (const vector< int > &idx, CV_OUT vector< vector< Point2f > > &facetList, CV_OUT vector< Point2f > &facetCenters) |
|
Point2f | getVertex (int vertex, CV_OUT int *firstEdge=0) const |
|
int | getEdge (int edge, int nextEdgeType) const |
|
int | nextEdge (int edge) const |
|
int | rotateEdge (int edge, int rotate) const |
|
int | symEdge (int edge) const |
|
int | edgeOrg (int edge, CV_OUT Point2f *orgpt=0) const |
|
int | edgeDst (int edge, CV_OUT Point2f *dstpt=0) const |
|
§ anonymous enum
Enumerator |
---|
PTLOC_ERROR | |
PTLOC_OUTSIDE_RECT | |
PTLOC_INSIDE | |
PTLOC_VERTEX | |
PTLOC_ON_EDGE | |
§ anonymous enum
Enumerator |
---|
NEXT_AROUND_ORG | |
NEXT_AROUND_DST | |
PREV_AROUND_ORG | |
PREV_AROUND_DST | |
NEXT_AROUND_LEFT | |
NEXT_AROUND_RIGHT | |
PREV_AROUND_LEFT | |
PREV_AROUND_RIGHT | |
§ Subdiv2D() [1/2]
cv::Subdiv2D::Subdiv2D |
( |
| ) |
|
§ Subdiv2D() [2/2]
cv::Subdiv2D::Subdiv2D |
( |
Rect |
rect | ) |
|
§ calcVoronoi()
void cv::Subdiv2D::calcVoronoi |
( |
| ) |
|
|
protected |
§ checkSubdiv()
void cv::Subdiv2D::checkSubdiv |
( |
| ) |
const |
|
protected |
§ clearVoronoi()
void cv::Subdiv2D::clearVoronoi |
( |
| ) |
|
|
protected |
§ connectEdges()
int cv::Subdiv2D::connectEdges |
( |
int |
edgeA, |
|
|
int |
edgeB |
|
) |
| |
|
protected |
§ deleteEdge()
void cv::Subdiv2D::deleteEdge |
( |
int |
edge | ) |
|
|
protected |
§ deletePoint()
void cv::Subdiv2D::deletePoint |
( |
int |
vtx | ) |
|
|
protected |
§ edgeDst()
§ edgeOrg()
§ findNearest()
§ getEdge()
int cv::Subdiv2D::getEdge |
( |
int |
edge, |
|
|
int |
nextEdgeType |
|
) |
| const |
§ getEdgeList()
§ getTriangleList()
void cv::Subdiv2D::getTriangleList |
( |
CV_OUT vector< Vec6f > & |
triangleList | ) |
const |
§ getVertex()
§ getVoronoiFacetList()
§ initDelaunay()
void cv::Subdiv2D::initDelaunay |
( |
Rect |
rect | ) |
|
§ insert() [1/2]
§ insert() [2/2]
void cv::Subdiv2D::insert |
( |
const vector< Point2f > & |
ptvec | ) |
|
§ isRightOf()
§ locate()
§ newEdge()
int cv::Subdiv2D::newEdge |
( |
| ) |
|
|
protected |
§ newPoint()
int cv::Subdiv2D::newPoint |
( |
Point2f |
pt, |
|
|
bool |
isvirtual, |
|
|
int |
firstEdge = 0 |
|
) |
| |
|
protected |
§ nextEdge()
int cv::Subdiv2D::nextEdge |
( |
int |
edge | ) |
const |
§ rotateEdge()
int cv::Subdiv2D::rotateEdge |
( |
int |
edge, |
|
|
int |
rotate |
|
) |
| const |
§ setEdgePoints()
void cv::Subdiv2D::setEdgePoints |
( |
int |
edge, |
|
|
int |
orgPt, |
|
|
int |
dstPt |
|
) |
| |
|
protected |
§ splice()
void cv::Subdiv2D::splice |
( |
int |
edgeA, |
|
|
int |
edgeB |
|
) |
| |
|
protected |
§ swapEdges()
void cv::Subdiv2D::swapEdges |
( |
int |
edge | ) |
|
|
protected |
§ symEdge()
int cv::Subdiv2D::symEdge |
( |
int |
edge | ) |
const |
§ bottomRight
§ freePoint
int cv::Subdiv2D::freePoint |
|
protected |
§ freeQEdge
int cv::Subdiv2D::freeQEdge |
|
protected |
§ qedges
§ recentEdge
int cv::Subdiv2D::recentEdge |
|
protected |
§ topLeft
§ validGeometry
bool cv::Subdiv2D::validGeometry |
|
protected |
§ vtx
vector<Vertex> cv::Subdiv2D::vtx |
|
protected |
The documentation for this class was generated from the following file: