radius_threshold_graph()

EdgeList MayaFlux::Kinesis::radius_threshold_graph	(	const Eigen::MatrixXd &	points,
		double	radius
	)

Compute radius threshold graph.

Parameters

points	Dx N matrix where each column is a point
radius	Maximum connection distance

Returns

Edge list (point index pairs)

Connects all point pairs within radius distance. Undirected graph: if (i,j) exists, edge appears once.

Complexity: O(n²) brute force

Definition at line 88 of file ProximityGraphs.cpp.

{
    Eigen::Index n = points.cols();
    if (n < 2) {
        return {};
    }
 
    double radius_sq = radius * radius;
    EdgeList edges;
 
    for (Eigen::Index i = 0; i < n; ++i) {
        for (Eigen::Index j = i + 1; j < n; ++j) {
            double dist_sq = distance_squared(points.col(i), points.col(j));
            if (dist_sq <= radius_sq) {
                edges.emplace_back(static_cast<size_t>(i), static_cast<size_t>(j));
            }
        }
    }
 
    MF_DEBUG(Journal::Component::Kinesis, Journal::Context::Runtime,
        "radius_threshold_graph: {} points, radius={:.3f}, generated {} edges",
        n, radius, edges.size());
 
    return edges;
}

References MayaFlux::Journal::Kinesis, MF_DEBUG, and MayaFlux::Journal::Runtime.

Referenced by generate_proximity_graph().

Here is the caller graph for this function: