/*========================================================================= medInria Copyright (c) INRIA 2013 - 2019. All rights reserved. See LICENSE.txt for details. This software is distributed WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. =========================================================================*/ #include #include "iterativeClosestPointPlugin.h" #include "iterativeClosestPointToolBox.h" iterativeClosestPointPlugin::iterativeClosestPointPlugin(QObject *parent) : medPluginLegacy(parent) { } bool iterativeClosestPointPlugin::initialize() { if(!iterativeClosestPointProcess::registered()) { qWarning() << "Unable to register iterativeClosestPoint type"; } if(!iterativeClosestPointToolBox::registered()) { qWarning() << "Unable to register iterativeClosestPoint toolbox"; } return true; } QString iterativeClosestPointPlugin::description() const { QString description; description += "

Iterative Closest Point Tutorial

"; description += "This toolbox matches the orientation and grid between two meshes."; description += "

Data

"; description += "Drop 2 meshes in the view, then select them in the 'Select the source mesh' and 'Select the target mesh' parameters."; description += "

Parameters

"; description += ""; description += "When you are ready, click on 'Run'."; description += "

This plugin uses the vtkIterativeClosestPointTransform class from VTK library: https://vtk.org"; return description; } QString iterativeClosestPointPlugin::name() const { return "Iterative Closest Point"; } QString iterativeClosestPointPlugin::version() const { return ITERATIVECLOSESTPOINTPLUGIN_VERSION; } QStringList iterativeClosestPointPlugin::types() const { return QStringList() << "iterativeClosestPoint"; }