void FakeMDEventData::addFakeUniformData(
typename MDEventWorkspace<MDE, nd>::sptr ws) {
std::vector<double> params = getProperty("UniformParams");
if (params.empty())
return;
bool randomEvents = true;
if (params[0] < 0) {
randomEvents = false;
params[0] = -params[0];
}
if (params.size() == 1) {
if (randomEvents) {
for (size_t d = 0; d < nd; ++d) {
params.push_back(ws->getDimension(d)->getMinimum());
params.push_back(ws->getDimension(d)->getMaximum());
}
} else // regular events
{
size_t nPoints = size_t(params[0]);
double Vol = 1;
for (size_t d = 0; d < nd; ++d)
Vol *= (ws->getDimension(d)->getMaximum() -
ws->getDimension(d)->getMinimum());
if (Vol == 0 || Vol > std::numeric_limits<float>::max())
throw std::invalid_argument(
" Domain ranges are not defined properly for workspace: " +
ws->getName());
double dV = Vol / double(nPoints);
double delta0 = std::pow(dV, 1. / double(nd));
for (size_t d = 0; d < nd; ++d) {
double min = ws->getDimension(d)->getMinimum();
params.push_back(min * (1 + FLT_EPSILON) - min + FLT_EPSILON);
double extent = ws->getDimension(d)->getMaximum() - min;
size_t nStrides = size_t(extent / delta0);
if (nStrides < 1)
nStrides = 1;
params.push_back(extent / static_cast<double>(nStrides));
}
}
}
if ((params.size() != 1 + nd * 2))
throw std::invalid_argument(
"UniformParams: needs to have ndims*2+1 arguments ");
if (randomEvents)
addFakeRandomData<MDE, nd>(params, ws);
else
addFakeRegularData<MDE, nd>(params, ws);
ws->splitBox();
Kernel::ThreadScheduler *ts = new ThreadSchedulerFIFO();
ThreadPool tp(ts);
ws->splitAllIfNeeded(ts);
tp.joinAll();
ws->refreshCache();
}
void vtkSplatterPlotFactory::doCreate(typename MDEventWorkspace<MDE, nd>::sptr ws) const
{
bool VERBOSE = true;
CPUTimer tim;
// Acquire a scoped read-only lock to the workspace (prevent segfault
// from algos modifying ws)
ReadLock lock(*ws);
// Find out how many events to plot, and the percentage of the largest
// boxes to use.
size_t totalPoints = ws->getNPoints();
size_t numPoints = m_numPoints;
if (numPoints > totalPoints)
{
numPoints = totalPoints;
}
double percent_to_use = m_percentToUse;
// Fail safe limits on fraction of boxes to use
if (percent_to_use <= 0)
{
percent_to_use = 5;
}
if (percent_to_use > 100)
{
percent_to_use = 100;
}
// First we get all the boxes, up to the given depth; with or wo the
// slice function
std::vector<API::IMDNode *> boxes;
if (this->slice)
{
ws->getBox()->getBoxes(boxes, 1000, true, this->sliceImplicitFunction);
}
else
{
ws->getBox()->getBoxes(boxes, 1000, true);
}
if (VERBOSE)
{
std::cout << tim << " to retrieve the "<< boxes.size() << " boxes down."<< std::endl;
}
std::string new_name = ws->getName();
if (new_name != m_wsName || m_buildSortedList)
{
m_wsName = new_name;
m_buildSortedList = false;
m_sortedBoxes.clear();
// get list of boxes with signal > 0 and sort
// the list in order of decreasing signal
for (size_t i = 0; i < boxes.size(); i++)
{
MDBox<MDE,nd> * box = dynamic_cast<MDBox<MDE,nd> *>(boxes[i]);
if (box)
{
size_t newPoints = box->getNPoints();
if (newPoints > 0)
{
m_sortedBoxes.push_back(box);
}
}
}
if (VERBOSE)
{
std::cout << "START SORTING" << std::endl;
}
std::sort(m_sortedBoxes.begin(), m_sortedBoxes.end(),
CompareNormalizedSignal);
if (VERBOSE)
{
std::cout << "DONE SORTING" << std::endl;
}
}
size_t num_boxes_to_use = static_cast<size_t>(percent_to_use * static_cast<double>(m_sortedBoxes.size()) / 100.0);
if (num_boxes_to_use >= m_sortedBoxes.size())
{
num_boxes_to_use = m_sortedBoxes.size()-1;
}
// restrict the number of points to the
// number of points in boxes being used
size_t total_points_available = 0;
for (size_t i = 0; i < num_boxes_to_use; i++)
{
size_t newPoints = m_sortedBoxes[i]->getNPoints();
total_points_available += newPoints;
}
if (numPoints > total_points_available)
{
numPoints = total_points_available;
}
size_t points_per_box = 0;
// calculate the average number of points to use per box
if (num_boxes_to_use > 0)
{
points_per_box = numPoints / num_boxes_to_use;
}
if (points_per_box < 1)
{
points_per_box = 1;
}
if (VERBOSE)
{
std::cout << "numPoints = " << numPoints << std::endl;
std::cout << "num boxes in all = " << boxes.size() << std::endl;
std::cout << "num boxes above zero = " << m_sortedBoxes.size() << std::endl;
std::cout << "num boxes to use = " << num_boxes_to_use << std::endl;
std::cout << "total_points_available = " << total_points_available << std::endl;
std::cout << "points needed per box = " << points_per_box << std::endl;
}
// First save the events and signals that we actually use.
// For each box, get up to the average number of points
// we want from each box, limited by the number of points
// in the box. NOTE: since boxes have different numbers
// of events, we will not get all the events requested.
// Also, if we are using a smaller number of points, we
// won't get points from some of the boxes with lower signal.
std::vector<float> saved_signals;
std::vector<const coord_t*> saved_centers;
std::vector<size_t> saved_n_points_in_cell;
saved_signals.reserve(numPoints);
saved_centers.reserve(numPoints);
saved_n_points_in_cell.reserve(numPoints);
size_t pointIndex = 0;
size_t box_index = 0;
bool done = false;
while (box_index < num_boxes_to_use && !done)
{
MDBox<MDE,nd> *box = dynamic_cast<MDBox<MDE,nd> *>(m_sortedBoxes[box_index]);
box_index++;
if (NULL == box)
{
continue;
}
float signal_normalized = static_cast<float>(box->getSignalNormalized());
size_t newPoints = box->getNPoints();
size_t num_from_this_box = points_per_box;
if (num_from_this_box > newPoints)
{
num_from_this_box = newPoints;
}
const std::vector<MDE> & events = box->getConstEvents();
size_t startPointIndex = pointIndex;
size_t event_index = 0;
while (event_index < num_from_this_box && !done)
{
const MDE & ev = events[event_index];
event_index++;
const coord_t * center = ev.getCenter();
// Save location
saved_centers.push_back(center);
pointIndex++;
if (pointIndex >= numPoints)
{
done = true;
}
}
box->releaseEvents();
// Save signal
saved_signals.push_back(signal_normalized);
// Save cell size
saved_n_points_in_cell.push_back(pointIndex-startPointIndex);
}
numPoints = saved_centers.size();
size_t numCells = saved_signals.size();
if (VERBOSE)
{
std::cout << "Recorded data for all points" << std::endl;
std::cout << "numPoints = " << numPoints << std::endl;
std::cout << "numCells = " << numCells << std::endl;
}
// Create the point list, one position for each point actually used
vtkPoints *points = vtkPoints::New();
points->Allocate(numPoints);
points->SetNumberOfPoints(numPoints);
// The list of IDs of points used, one ID per point, since points
// are not reused to form polygon facets, etc.
vtkIdType *ids = new vtkIdType[numPoints];
// Only one scalar for each cell, NOT one per point
vtkFloatArray *signal = vtkFloatArray::New();
signal->Allocate(numCells);
signal->SetName(m_scalarName.c_str());
// Create the data set. Need space for each cell, not for each point
vtkUnstructuredGrid *visualDataSet = vtkUnstructuredGrid::New();
this->dataSet = visualDataSet;
visualDataSet->Allocate(numCells);
// Now copy the saved point, cell and signal info into vtk data structures
pointIndex = 0;
for (size_t cell_i = 0; cell_i < numCells; cell_i++)
{
size_t startPointIndex = pointIndex;
for (size_t point_i = 0; point_i < saved_n_points_in_cell[cell_i]; point_i++)
{
points->SetPoint(pointIndex, saved_centers[pointIndex]);
ids[pointIndex] = pointIndex;
pointIndex++;
}
signal->InsertNextTuple1(saved_signals[cell_i]);
visualDataSet->InsertNextCell(VTK_POLY_VERTEX, saved_n_points_in_cell[cell_i], ids+startPointIndex);
}
if (VERBOSE)
{
std::cout << tim << " to create " << pointIndex << " points." << std::endl;
}
// Shrink to fit
//points->Squeeze();
signal->Squeeze();
visualDataSet->Squeeze();
// Add points and scalars
visualDataSet->SetPoints(points);
visualDataSet->GetCellData()->SetScalars(signal);
delete [] ids;
}
