public class KeyPointsCircleHexagonalGrid
extends java.lang.Object
Computes key points from an observed hexagonal circular grid. Each key point is defined as the circle's true geometric center. The center (green dot) is found by detecting tangent points between two neighboring circles (yellow dots) and then finding the intersection of all the lines created by connecting adjacent tangent points. Tangent points are the same under perspective distortion and the same can be said for the intersection of their lines.
| Modifier and Type | Class and Description |
|---|---|
static class |
KeyPointsCircleHexagonalGrid.Tangents |
| Constructor and Description |
|---|
KeyPointsCircleHexagonalGrid() |
| Modifier and Type | Method and Description |
|---|---|
org.ddogleg.struct.FastQueue<georegression.struct.point.Point2D_F64> |
getKeyPoints()
Returns the location of each key point in the image from the most recently processed grid.
|
org.ddogleg.struct.FastQueue<KeyPointsCircleHexagonalGrid.Tangents> |
getTangents() |
boolean |
process(EllipseClustersIntoGrid.Grid grid)
Computes key points from the grid of ellipses
|
public boolean process(EllipseClustersIntoGrid.Grid grid)
grid - Grid of ellipsespublic org.ddogleg.struct.FastQueue<georegression.struct.point.Point2D_F64> getKeyPoints()
public org.ddogleg.struct.FastQueue<KeyPointsCircleHexagonalGrid.Tangents> getTangents()