 |
 |
Hi Holly, I am also puzzled. Unless someone who isn't set up to run lcsim (e.g. Stepan?) needs to be able to run the code (vs. just making histograms from output ntuples), I can't imagine why one would use C++ for the reconstruction of events. I'm sure I can write any clustering algorithm you would want in 20 lines or less in lcsim by modifying the class you created and were already modifying at the workshop. Anything that gets written in C++ has to be ported back into lcsim anyway if we want to advance the state of our software. Perhaps if we better understood the goal, we could give you better advice on how to proceed. Cheers, Tim On Feb 4, 2014, at 7:02 AM, Holly Vance <[log in to unmask]> wrote: > Hi everyone, > > I am creating a stand alone clustering algorithm in C++ (in addition to our one in java)-does anyone know the easiest way to extract the crystal map (volume location, position->to find nearest neighbors)? Thanks! > > -- > Respectfully, > Holly > > > Use REPLY-ALL to reply to list > > To unsubscribe from the HPS-SOFTWARE list, click the following link: > https://listserv.slac.stanford.edu/cgi-bin/wa?SUBED1=HPS-SOFTWARE&A=1 > ######################################################################## Use REPLY-ALL to reply to list To unsubscribe from the HPS-SOFTWARE list, click the following link: https://listserv.slac.stanford.edu/cgi-bin/wa?SUBED1=HPS-SOFTWARE&A=1