cvlee.cpp.svn-base
来自「非结构化路识别」· SVN-BASE 代码 · 共 1,445 行 · 第 1/5 页
SVN-BASE
1,445 行
pCvVoronoiNode pNode,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Compute the bisector of point and site
Arguments
pSite : in, site
pNode : in, point
pVoronoiDiagram : in, pointer to struct, which contains the
description of Voronoi Diagram
pEdge : out, bisector
Return :
--------------------------------------------------------------------------*/
void _cvCalcEdge(pCvVoronoiNode pNode,
pCvVoronoiSite pSite,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Compute the direction of bisector of two segments
Arguments
pDirection1: in, direction of first segment
pDirection2: in, direction of second segment
pVoronoiDiagram : in, pointer to struct, which contains the
description of Voronoi Diagram
pEdge : out, bisector
Return :
--------------------------------------------------------------------------*/
OPENCVAPI CV_INLINE
void _cvCalcEdgeLL(pCvDirection pDirection1,
pCvDirection pDirection2,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Compute the bisector of two points
Arguments
pPoint1, pPoint2: in, given points
pVoronoiDiagram : in, pointer to struct, which contains the
description of Voronoi Diagram
pEdge : out, bisector
Return :
--------------------------------------------------------------------------*/
OPENCVAPI CV_INLINE
void _cvCalcEdgePP(pCvPointFloat pPoint1,
pCvPointFloat pPoint2,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Compute the bisector of segment and point. Since
it is parabola, it is defined by its focus (site - point)
and directrice(site-segment)
Arguments
pFocus : in, point, which defines the focus of parabola
pDirectrice: in, site - segment, which defines the directrice of parabola
pVoronoiDiagram : in, pointer to struct, which contains the
description of Voronoi Diagram
pEdge : out, bisector
Return :
--------------------------------------------------------------------------*/
OPENCVAPI CV_INLINE
void _cvCalcEdgePL(pCvVoronoiNode pFocus,
pCvVoronoiSite pDirectrice,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Compute the bisector of segment and point. Since
it is parabola, it is defined by its focus (site - point)
and directrice(site-segment)
Arguments
pFocus : in, point, which defines the focus of parabola
pDirectrice: in, site - segment, which defines the directrice of parabola
pVoronoiDiagram : in, pointer to struct, which contains the
description of Voronoi Diagram
pEdge : out, bisector
Return :
--------------------------------------------------------------------------*/
OPENCVAPI CV_INLINE
void _cvCalcEdgeLP(pCvVoronoiSite pDirectrice,
pCvVoronoiNode pFocus,
pCvVoronoiEdge pEdge,
CvVoronoiDiagramInt* pVoronoiDiagram);
/*////////////////////////////////////////////////////////////////////////////////////////
// Computation of intersections of bisectors //
////////////////////////////////////////////////////////////////////////////////////////*/
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1,pEdge2: in, two edges
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvCalcEdgeIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
CvPointFloat* pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, straight ray
pEdge2: in, straight ray or segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvLine_LineIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, straight ray
pEdge2: in, parabolic ray or segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvLine_ParIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, straight ray
pEdge2: in, parabolic segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvLine_CloseParIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, straight ray
pEdge2: in, parabolic ray
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvLine_OpenParIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, parabolic ray
pEdge2: in, straight ray or segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvPar_LineIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, parabolic ray
pEdge2: in, straight ray
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvPar_OpenLineIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, parabolic ray
pEdge2: in, straight segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvPar_CloseLineIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
float &Radius);
/*--------------------------------------------------------------------------
Author : Andrey Sobolev
Description : Function computes intersection of two edges. Intersection
must be the nearest to the marked point on pEdge1
(this marked point is pEdge1->node1->node).
Arguments
pEdge1 : in, parabolic ray
pEdge2: in, parabolic ray or segment
pPoint: out, intersection of pEdge1 and pEdge2
Radius: out, distance between pPoint and sites, assosiated
with pEdge1 and pEdge2 (pPoint is situated on the equal
distance from site, assosiated with pEdge1 and from
site,assosiated with pEdge2)
Return : distance between pPoint and marked point on pEdge1 or
: -1, if edges have no intersections
--------------------------------------------------------------------------*/
OPENCVAPI
float _cvPar_ParIntersection(pCvVoronoiEdge pEdge1,
pCvVoronoiEdge pEdge2,
pCvPointFloat pPoint,
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?