SkeletonAlg.cxx File Reference

This algorithm accepts a list of 3D space points and attempts to find the "medial skeleton" describing the "best" path through them. Here, "medial" is defined by the best time match between associated 2D hits along the "best" directions. More...

#include "fhiclcpp/ParameterSet.h"
#include "larreco/RecoAlg/Cluster3DAlgs/SkeletonAlg.h"
#include "larcore/Geometry/Geometry.h"
#include "lardataobj/RecoBase/Hit.h"
#include <string>
#include <functional>
#include <iostream>
#include <memory>

Go to the source code of this file.

Classes
class	lar_cluster3d::OrderHitsAlongWire
struct	lar_cluster3d::OrderBestPlanes

Namespaces
	lar_cluster3d

Detailed Description

This algorithm accepts a list of 3D space points and attempts to find the "medial skeleton" describing the "best" path through them. Here, "medial" is defined by the best time match between associated 2D hits along the "best" directions.

Definition in file SkeletonAlg.cxx.