triggeralgs::dbscan Namespace Reference

Classes
struct	Cluster
struct	Hit
class	HitSet
class	IncrementalDBSCAN

Enumerations
enum class	Connectedness { kUndefined , kNoise , kCore , kEdge }
enum class	Completeness { kIncomplete , kComplete }

Functions
int	neighbours_sorted (const std::vector< Hit * > &hits, Hit &q, float eps, int minPts)
float	manhattan_distance (const Hit &p, const Hit &q)
template<class T >
T	sqr (T x)
float	euclidean_distance (const Hit &p, const Hit &q)
float	euclidean_distance_sqr (const Hit &p, const Hit &q)
bool	time_comp_lower (const Hit *hit, const float t)

Variables
const int	kNoise = -2
const int	kUndefined = -1

Enumeration Type Documentation

Completeness

enum class triggeralgs::dbscan::Completeness

strong

Enumerator
kIncomplete
kComplete

Definition at line 37 of file Hit.hpp.

{
    kIncomplete,
    kComplete,
};

Connectedness

enum class triggeralgs::dbscan::Connectedness

strong

Enumerator
kUndefined
kNoise
kCore
kEdge

Definition at line 20 of file Hit.hpp.

{
    // clang-format off
    kUndefined,
    kNoise,     // Fewer than minPts neighbours, not in a cluster
    kCore,      // minPts neighbours or more
    kEdge       // Fewer than minPts neighbours, part of a cluster
          // clang-format on
};

Function Documentation

euclidean_distance()

float triggeralgs::dbscan::euclidean_distance ( const Hit & p, const Hit & q )

inline

Definition at line 106 of file Hit.hpp.

{
    return std::sqrt(sqr(p.time - q.time) + sqr(p.chan - q.chan));
}

euclidean_distance_sqr()

float triggeralgs::dbscan::euclidean_distance_sqr ( const Hit & p, const Hit & q )

inline

Definition at line 113 of file Hit.hpp.

{
    return sqr(p.time - q.time) + sqr(p.chan - q.chan);
}

manhattan_distance()

float triggeralgs::dbscan::manhattan_distance ( const Hit & p, const Hit & q )

inline

Definition at line 91 of file Hit.hpp.

{
    return fabs((p.time - q.time)) + fabs(p.chan - q.chan);
}

neighbours_sorted()

int triggeralgs::dbscan::neighbours_sorted	(	const std::vector< Hit * > &	hits,
		Hit &	q,
		float	eps,
		int	minPts )

Definition at line 12 of file dbscan.cpp.

{
    int n = 0;
    // Loop over the hits starting from the latest hit, since we will
    // ~always be adding a hit at recent times
    for (auto hit_it = hits.rbegin(); hit_it != hits.rend(); ++hit_it) {
        if ((*hit_it)->time > q.time + eps)
            continue;
        if ((*hit_it)->time < q.time - eps)
            break;
 
        if (q.add_potential_neighbour(*hit_it, eps, minPts))
            ++n;
    }
    return n;
}

sqr()

template<class T >

T triggeralgs::dbscan::sqr ( T x )

inline

Definition at line 99 of file Hit.hpp.

{
    return x * x;
}

time_comp_lower()

bool triggeralgs::dbscan::time_comp_lower ( const Hit * hit, const float t )

inline

Definition at line 120 of file Hit.hpp.

{
    return hit->time < t;
}

Variable Documentation

kNoise

const int triggeralgs::dbscan::kNoise = -2

Definition at line 14 of file Hit.hpp.

kUndefined

const int triggeralgs::dbscan::kUndefined = -1

Definition at line 15 of file Hit.hpp.