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
ClusteringControl.cc
Go to the documentation of this file.
1 // -*- lsst-c++ -*-
2 
3 /*
4  * LSST Data Management System
5  * Copyright 2012 LSST Corporation.
6  *
7  * This product includes software developed by the
8  * LSST Project (http://www.lsst.org/).
9  *
10  * This program is free software: you can redistribute it and/or modify
11  * it under the terms of the GNU General Public License as published by
12  * the Free Software Foundation, either version 3 of the License, or
13  * (at your option) any later version.
14  *
15  * This program is distributed in the hope that it will be useful,
16  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18  * GNU General Public License for more details.
19  *
20  * You should have received a copy of the LSST License Statement and
21  * the GNU General Public License along with this program. If not,
22  * see <http://www.lsstcorp.org/LegalNotices/>.
23  */
24 
30 
31 #include "lsst/pex/exceptions.h"
32 
33 
34 using lsst::pex::exceptions::InvalidParameterError;
35 
36 namespace lsst { namespace ap { namespace cluster {
37 
39  epsilonArcsec(0.75),
40  minNeighbors(2),
41  pointsPerLeaf(32),
42  leafExtentThresholdArcsec(2.0)
43 {
44  validate();
45 }
46 
48 
50  if (epsilonArcsec < 0.0 || epsilonArcsec > 36000.0) {
51  throw LSST_EXCEPT(InvalidParameterError,
52  "epsilonArcsec must lie in the range [0, 36000]");
53  }
54  if (minNeighbors < 0) {
55  throw LSST_EXCEPT(InvalidParameterError,
56  "minNeighbors must be non-negative");
57 
58  }
59  if (pointsPerLeaf <= 0) {
60  throw LSST_EXCEPT(InvalidParameterError,
61  "pointsPerLeaf must be positive");
62  }
63 }
64 
65 }}} // namespace lsst::ap::cluster
Clustering algorithm control.
std::vector< SourceCatalog > const cluster(SourceCatalog const &sources, ClusteringControl const &control)
Definition: clustering.cc:578
int pointsPerLeaf
&quot;A performance tuning parameter for the k-d tree used internally by\n&quot; &quot;the OPTICS implementation...
int minNeighbors
&quot;The minimum cardinality of the epsilonArcsec-neighborhood of a source\n&quot; &quot;S for S to be considered a...
#define LSST_EXCEPT(type,...)
Definition: Exception.h:46
Include files required for standard LSST Exception handling.