OpenCV
3.3.0
Open Source Computer Vision
|
#include "imgproc.hpp"
Classes | |
struct | QuadEdge |
struct | Vertex |
Public Types | |
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 } |
Public Member Functions | |
Subdiv2D () | |
Subdiv2D (Rect rect) | |
int | edgeDst (int edge, Point2f *dstpt=0) const |
Returns the edge destination. More... | |
int | edgeOrg (int edge, Point2f *orgpt=0) const |
Returns the edge origin. More... | |
int | findNearest (Point2f pt, Point2f *nearestPt=0) |
Finds the subdivision vertex closest to the given point. More... | |
int | getEdge (int edge, int nextEdgeType) const |
Returns one of the edges related to the given edge. More... | |
void | getEdgeList (std::vector< Vec4f > &edgeList) const |
Returns a list of all edges. More... | |
void | getLeadingEdgeList (std::vector< int > &leadingEdgeList) const |
Returns a list of the leading edge ID connected to each triangle. More... | |
void | getTriangleList (std::vector< Vec6f > &triangleList) const |
Returns a list of all triangles. More... | |
Point2f | getVertex (int vertex, int *firstEdge=0) const |
Returns vertex location from vertex ID. More... | |
void | getVoronoiFacetList (const std::vector< int > &idx, std::vector< std::vector< Point2f > > &facetList, std::vector< Point2f > &facetCenters) |
Returns a list of all Voroni facets. More... | |
void | initDelaunay (Rect rect) |
Creates a new empty Delaunay subdivision. More... | |
int | insert (Point2f pt) |
Insert a single point into a Delaunay triangulation. More... | |
void | insert (const std::vector< Point2f > &ptvec) |
Insert multiple points into a Delaunay triangulation. More... | |
int | locate (Point2f pt, int &edge, int &vertex) |
Returns the location of a point within a Delaunay triangulation. More... | |
int | nextEdge (int edge) const |
Returns next edge around the edge origin. More... | |
int | rotateEdge (int edge, int rotate) const |
Returns another edge of the same quad-edge. More... | |
int | symEdge (int edge) const |
Protected Member Functions | |
void | calcVoronoi () |
void | checkSubdiv () const |
void | clearVoronoi () |
int | connectEdges (int edgeA, int edgeB) |
void | deleteEdge (int edge) |
void | deletePoint (int vtx) |
int | isRightOf (Point2f pt, int edge) const |
int | newEdge () |
int | newPoint (Point2f pt, bool isvirtual, int firstEdge=0) |
void | setEdgePoints (int edge, int orgPt, int dstPt) |
void | splice (int edgeA, int edgeB) |
void | swapEdges (int edge) |
Protected Attributes | |
Point2f | bottomRight |
Bottom right corner of the bounding rect. More... | |
int | freePoint |
int | freeQEdge |
std::vector< QuadEdge > | qedges |
All of the edges. More... | |
int | recentEdge |
Point2f | topLeft |
Top left corner of the bounding rect. More... | |
bool | validGeometry |
std::vector< Vertex > | vtx |
All of the vertices. More... | |
anonymous enum |
Subdiv2D point location cases
anonymous enum |
cv::Subdiv2D::Subdiv2D | ( | ) |
creates an empty Subdiv2D object. To create a new empty Delaunay subdivision you need to use the initDelaunay() function.
cv::Subdiv2D::Subdiv2D | ( | Rect | rect | ) |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
rect | Rectangle that includes all of the 2D points that are to be added to the subdivision. |
The function creates an empty Delaunay subdivision where 2D points can be added using the function insert() . All of the points to be added must be within the specified rectangle, otherwise a runtime error is raised.
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
int cv::Subdiv2D::edgeDst | ( | int | edge, |
Point2f * | dstpt = 0 |
||
) | const |
Returns the edge destination.
edge | Subdivision edge ID. |
dstpt | Output vertex location. |
int cv::Subdiv2D::edgeOrg | ( | int | edge, |
Point2f * | orgpt = 0 |
||
) | const |
Returns the edge origin.
edge | Subdivision edge ID. |
orgpt | Output vertex location. |
Finds the subdivision vertex closest to the given point.
pt | Input point. |
nearestPt | Output subdivision vertex point. |
The function is another function that locates the input point within the subdivision. It finds the subdivision vertex that is the closest to the input point. It is not necessarily one of vertices of the facet containing the input point, though the facet (located using locate() ) is used as a starting point.
int cv::Subdiv2D::getEdge | ( | int | edge, |
int | nextEdgeType | ||
) | const |
Returns one of the edges related to the given edge.
edge | Subdivision edge ID. |
nextEdgeType | Parameter specifying which of the related edges to return. The following values are possible:
|
void cv::Subdiv2D::getEdgeList | ( | std::vector< Vec4f > & | edgeList | ) | const |
Returns a list of all edges.
edgeList | Output vector. |
The function gives each edge as a 4 numbers vector, where each two are one of the edge vertices. i.e. org_x = v[0], org_y = v[1], dst_x = v[2], dst_y = v[3].
void cv::Subdiv2D::getLeadingEdgeList | ( | std::vector< int > & | leadingEdgeList | ) | const |
Returns a list of the leading edge ID connected to each triangle.
leadingEdgeList | Output vector. |
The function gives one edge ID for each triangle.
void cv::Subdiv2D::getTriangleList | ( | std::vector< Vec6f > & | triangleList | ) | const |
Returns a list of all triangles.
triangleList | Output vector. |
The function gives each triangle as a 6 numbers vector, where each two are one of the triangle vertices. i.e. p1_x = v[0], p1_y = v[1], p2_x = v[2], p2_y = v[3], p3_x = v[4], p3_y = v[5].
Point2f cv::Subdiv2D::getVertex | ( | int | vertex, |
int * | firstEdge = 0 |
||
) | const |
Returns vertex location from vertex ID.
vertex | vertex ID. |
firstEdge | Optional. The first edge ID which is connected to the vertex. |
void cv::Subdiv2D::getVoronoiFacetList | ( | const std::vector< int > & | idx, |
std::vector< std::vector< Point2f > > & | facetList, | ||
std::vector< Point2f > & | facetCenters | ||
) |
Returns a list of all Voroni facets.
idx | Vector of vertices IDs to consider. For all vertices you can pass empty vector. |
facetList | Output vector of the Voroni facets. |
facetCenters | Output vector of the Voroni facets center points. |
void cv::Subdiv2D::initDelaunay | ( | Rect | rect | ) |
Creates a new empty Delaunay subdivision.
rect | Rectangle that includes all of the 2D points that are to be added to the subdivision. |
int cv::Subdiv2D::insert | ( | Point2f | pt | ) |
Insert a single point into a Delaunay triangulation.
pt | Point to insert. |
The function inserts a single point into a subdivision and modifies the subdivision topology appropriately. If a point with the same coordinates exists already, no new point is added.
void cv::Subdiv2D::insert | ( | const std::vector< Point2f > & | ptvec | ) |
Insert multiple points into a Delaunay triangulation.
ptvec | Points to insert. |
The function inserts a vector of points into a subdivision and modifies the subdivision topology appropriately.
|
protected |
int cv::Subdiv2D::locate | ( | Point2f | pt, |
int & | edge, | ||
int & | vertex | ||
) |
Returns the location of a point within a Delaunay triangulation.
pt | Point to locate. |
edge | Output edge that the point belongs to or is located to the right of it. |
vertex | Optional output vertex the input point coincides with. |
The function locates the input point within the subdivision and gives one of the triangle edges or vertices.
|
protected |
|
protected |
int cv::Subdiv2D::nextEdge | ( | int | edge | ) | const |
Returns next edge around the edge origin.
edge | Subdivision edge ID. |
int cv::Subdiv2D::rotateEdge | ( | int | edge, |
int | rotate | ||
) | const |
Returns another edge of the same quad-edge.
edge | Subdivision edge ID. |
rotate | Parameter specifying which of the edges of the same quad-edge as the input one to return. The following values are possible:
|
|
protected |
|
protected |
|
protected |
int cv::Subdiv2D::symEdge | ( | int | edge | ) | const |
|
protected |
Bottom right corner of the bounding rect.
|
protected |
|
protected |
|
protected |
All of the edges.
|
protected |
|
protected |
Top left corner of the bounding rect.
|
protected |
|
protected |
All of the vertices.