\brief Set the axis along which we need to search for a model perpendicular to. * \param[in] ax the axis along which we need to search for a m

////////////////////////////////////////////////////////////////////////////////////////

\brief Set the maximum distance between corresponding points. * Correspondences with distances below the threshold are considered as inliers. *

\brief Set the multiplier of the nearest neighbor distance to obtain the final search radius for each point * (this will make the algorithm ad

\brief Set warp parameters. * \param[in] p warp parameters (tx ty rz) */

\brief Set the order of the polynomial to be fit. * \param[in] order the order of the polynomial * \note Setting order > 1 indicates u

/////////////////////////////////////////////////////////////////////////////////////

\brief Convert the given half-edge index to an edge index. */

/////////////////////////////////////////////////////////////////////////////////////////

///////////////////////////////////////////////////////////////////////////////////////// Update the look up table displayed when 'u' is pressed

virtual ON_UserData overrides

///////////////////////////////////////////////////////////////////////////////////////// \brief Check if val1 and val2 are equals. * * \param[in]

@brief Begin iterator of available moves queue.

////////////////////////////////////////////////////////////////////////////////////

\brief Retrieve a child node pointer for child node at child_idx. * \param branch_arg: reference to octree branch class * \param child_idx_arg:

//////////////////////////////////////////////////////////////////////////////////////////////////////////////

\brief Convenience function to get Item's ID String */

\brief Get number of points at specified LOD * \param[in] depth_index the level of detail at which we want the number of points (0 is root,

\brief Get the originating vertex index to a given half-edge. */

///////////////////////////////////////////////////////////////////////////

\brief Return the state of convergence after the last align run */

\brief Load any OBJ file into a templated PointCloud type. * \param[in] file_name the name of the file to load * \param[out] cloud the res

////////////////////////////////////////////////////////////////////////////////////////

////////////////////////////////////////////////////////////////////////////////////////

//////////////////////////////////////////////////////////////////////////////////////////////////////////////

\brief Set the maximum angle each triangle can have. * \param[in] maximum_angle the maximum angle each triangle can have * \note For b

\brief Set the maximum number of nearest neighbors to be searched for. * \param[in] nnn the maximum number of nearest neighbors */

\brief Set the number of nearest neighbors to use for mean distance estimation. * \param[in] nr_k The number of points to use for mean distanc

\brief Set the minimum number of inliers required for a plane * \param[in] min_inliers the minimum number of inliers required per plane

\brief Set the minimum angle each triangle should have. * \param[in] minimum_angle the minimum angle each triangle should have * \note

\brief Set the flag if the input normals are oriented consistently. * \param[in] consistent set it to true if the normals are consistently ori

\brief Set the normals distance weight*/

\brief Set the outgoing half-edge index to a given vertex. */

\brief Set the minimum and maximum allowable radius limits for the model (applicable to models that estimate * a radius) * \param[in]

\brief Set the standard deviation multiplier for the distance threshold calculation. * \details The distance threshold will be equal to: mean

/////////////////////////////////////////////////////////////////////////////////////