|
MayaFlux 0.2.0
Digital-First Multimedia Processing Framework
|
| EdgeList MayaFlux::Kinesis::gabriel_graph | ( | const Eigen::MatrixXd & | points | ) |
Compute Gabriel graph.
| points | DxN matrix where each column is a point |
Gabriel property: Edge (p,q) exists iff disk with diameter pq contains no other points. Subset of Delaunay triangulation.
The Gabriel graph is a proximity graph defined by the following rule: Two points p and q are connected if and only if the closed disk having the line segment pq as diameter contains no other points.
Equivalently: |p-r|² + |q-r|² ≥ |p-q|² for all r ∈ P \ {p,q}
Complexity: O(n³) with naive geometric tests
Definition at line 161 of file ProximityGraphs.cpp.
References MayaFlux::Journal::Kinesis, MF_DEBUG, q, and MayaFlux::Journal::Runtime.
Referenced by generate_proximity_graph().
Here is the caller graph for this function: