boofcv.alg.fiducial.calib.squares
Class SquaresIntoCrossClusters
- java.lang.Object
-
- boofcv.alg.fiducial.calib.squares.SquaresIntoClusters
-
- boofcv.alg.fiducial.calib.squares.SquaresIntoCrossClusters
-
public class SquaresIntoCrossClusters extends SquaresIntoClusters
Processes the detected squares in the image and connects them into clusters in which the corners of each square almost touches the corner of a neighbor.
-
-
Field Summary
Fields Modifier and Type Field and Description intmaxNeighbors
-
Constructor Summary
Constructors Constructor and Description SquaresIntoCrossClusters(double maxCornerDistance, int maxNeighbors)Declares data structures and configures algorithm
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method and Description java.util.List<java.util.List<SquareNode>>process(java.util.List<Polygon2D_F64> squares, java.util.List<BinaryPolygonDetector.Info> info)Processes the unordered set of squares and creates a graph out of them using prior knowledge and geometric constraints.
-
-
-
Constructor Detail
-
SquaresIntoCrossClusters
public SquaresIntoCrossClusters(double maxCornerDistance, int maxNeighbors)Declares data structures and configures algorithm- Parameters:
maxCornerDistance- Maximum distance two corners can be in pixels.maxNeighbors- Max number of neighbors it will consider. Try 4 or -1 for all
-
-
Method Detail
-
process
public java.util.List<java.util.List<SquareNode>> process(java.util.List<Polygon2D_F64> squares, java.util.List<BinaryPolygonDetector.Info> info)
Processes the unordered set of squares and creates a graph out of them using prior knowledge and geometric constraints.- Parameters:
squares- Set of squares- Returns:
- List of graphs. All data structures are recycled on the next call to process().
-
-
DataMelt 3.0 © DataMelt by jWork.ORG