|
LSSTApplications
1.1.2+25,10.0+13,10.0+132,10.0+133,10.0+224,10.0+41,10.0+8,10.0-1-g0f53050+14,10.0-1-g4b7b172+19,10.0-1-g61a5bae+98,10.0-1-g7408a83+3,10.0-1-gc1e0f5a+19,10.0-1-gdb4482e+14,10.0-11-g3947115+2,10.0-12-g8719d8b+2,10.0-15-ga3f480f+1,10.0-2-g4f67435,10.0-2-gcb4bc6c+26,10.0-28-gf7f57a9+1,10.0-3-g1bbe32c+14,10.0-3-g5b46d21,10.0-4-g027f45f+5,10.0-4-g86f66b5+2,10.0-4-gc4fccf3+24,10.0-40-g4349866+2,10.0-5-g766159b,10.0-5-gca2295e+25,10.0-6-g462a451+1
LSSTDataManagementBasePackage
|
Main OPTICS algorithm implementation class. More...
#include <vector>#include "boost/scoped_array.hpp"#include "boost/scoped_ptr.hpp"#include "boost/shared_ptr.hpp"#include "lsst/pex/logging/Log.h"#include "KDTree.h"#include "SeedList.h"Go to the source code of this file.
Classes | |
| class | lsst::ap::cluster::detail::Optics< K, RecordT > |
Namespaces | |
| lsst | |
| < multiple inclusion guard macro | |
| lsst::ap | |
| lsst::ap::cluster | |
| lsst::ap::cluster::detail | |
Main OPTICS algorithm implementation class.
For details of the algorithm, see the following paper:
"OPTICS: Ordering Points To Identify the Clustering Structure". Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, Jorg Sander (1999). ACM SIGMOD international conference on Management of data. ACM Press. pp. 49-60.
Definition in file Optics.h.
1.8.5