Lines Matching refs:sites
198 // Purpose : Compute sites for given polygon with holes
210 // Return: 1, if sites were succesfully constructed
234 // Purpose: Compute skeleton for given collection of sites, using Lee algorithm
247 // Purpose: Construct tree of sites (by analogy with contour tree).
356 Description : Compute sites for external polygon.
365 Return: 1, if sites were succesfully constructed
376 Description : Compute sites for internal polygon (for hole).
380 CurrSiteSeq: in, the sequence for sites to be constructed
387 Return: 1, if sites were succesfully constructed
400 Description : Compute the simple chains of sites for external polygon.
412 Description : Compute the simple chains of sites for internal polygon (= hole)
416 CurrSiteSeq : in, the sequence of sites
550 Description : Compute the bisector of two sites
552 pSite_left,pSite_right: in, given sites
678 Radius: out, distance between pPoint and sites, assosiated
700 Radius: out, distance between pPoint and sites, assosiated
722 Radius: out, distance between pPoint and sites, assosiated
744 Radius: out, distance between pPoint and sites, assosiated
766 Radius: out, distance between pPoint and sites, assosiated
788 Radius: out, distance between pPoint and sites, assosiated
809 Radius: out, distance between pPoint and sites, assosiated
831 Radius: out, distance between pPoint and sites, assosiated
853 Radius: out, distance between pPoint and sites, assosiated
876 Radius: out, distance between pPoint and sites, assosiated
898 Radius: out, distance between pPoint and sites, assosiated
1454 for(Seq = (CvSeq*)VoronoiDiagram->sites; Seq != NULL; Seq = Seq->h_next)
1913 VoronoiDiagram->sites = NewSiteSeq;
2106 VoronoiDiagram->sites = NewSiteSeq;
