small_gicp/doc_cpp/namespacesmall__gicp.html

2552 lines
157 KiB
HTML

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>small_gicp: small_gicp Namespace Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">small_gicp
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#nested-classes">Classes</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">small_gicp Namespace Reference</div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:namespacesmall__gicp_1_1traits"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp_1_1traits.html">traits</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Point container with a flat vector. <a href="structsmall__gicp_1_1FlatContainer.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1GaussianVoxel.html">GaussianVoxel</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gaussian voxel that computes and stores voxel mean and covariance. <a href="structsmall__gicp_1_1GaussianVoxel.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1VoxelInfo.html">VoxelInfo</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Voxel meta information. <a href="structsmall__gicp_1_1VoxelInfo.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html">IncrementalVoxelMap</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Incremental voxelmap. This class supports incremental point cloud insertion and LRU-based voxel deletion that removes voxels that are not recently referenced. <a href="structsmall__gicp_1_1IncrementalVoxelMap.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KdTreeNode.html">KdTreeNode</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1KdTree.html" title="&quot;Safe&quot; KdTree that holds the ownership of the input points.">KdTree</a> node. <a href="structsmall__gicp_1_1KdTreeNode.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KdTreeBuilder.html">KdTreeBuilder</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Single thread Kd-tree builder. <a href="structsmall__gicp_1_1KdTreeBuilder.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1UnsafeKdTree.html">UnsafeKdTree</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">"Unsafe" <a class="el" href="structsmall__gicp_1_1KdTree.html" title="&quot;Safe&quot; KdTree that holds the ownership of the input points.">KdTree</a>. <a href="structsmall__gicp_1_1UnsafeKdTree.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">"Safe" <a class="el" href="structsmall__gicp_1_1KdTree.html" title="&quot;Safe&quot; KdTree that holds the ownership of the input points.">KdTree</a> that holds the ownership of the input points. <a href="structsmall__gicp_1_1KdTree.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KdTreeBuilderOMP.html">KdTreeBuilderOMP</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Kd-tree builder with OpenMP. <a href="structsmall__gicp_1_1KdTreeBuilderOMP.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KdTreeBuilderTBB.html">KdTreeBuilderTBB</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Kd-tree builder with TBB. <a href="structsmall__gicp_1_1KdTreeBuilderTBB.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KnnSetting.html">KnnSetting</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">K-nearest neighbor search setting. <a href="structsmall__gicp_1_1KnnSetting.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1identity__transform.html">identity_transform</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Identity transform (alternative to std::identity in C++20). <a href="structsmall__gicp_1_1identity__transform.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1KnnResult.html">KnnResult</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">K-nearest neighbor search result container. <a href="structsmall__gicp_1_1KnnResult.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1ProjectionSetting.html">ProjectionSetting</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameters to control the projection axis search. <a href="structsmall__gicp_1_1ProjectionSetting.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1AxisAlignedProjection.html">AxisAlignedProjection</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Conventional axis-aligned projection (i.e., selecting any of XYZ axes with the largest variance). <a href="structsmall__gicp_1_1AxisAlignedProjection.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1NormalProjection.html">NormalProjection</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Normal projection (i.e., selecting the 3D direction with the largest variance of the points). <a href="structsmall__gicp_1_1NormalProjection.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1NullFactor.html">NullFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Null factor that gives no constraints. <a href="structsmall__gicp_1_1NullFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1RestrictDoFFactor.html">RestrictDoFFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Factor to restrict the degrees of freedom of optimization (e.g., fixing roll, pitch rotation). <a href="structsmall__gicp_1_1RestrictDoFFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1GICPFactor.html">GICPFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">GICP (distribution-to-distribution) per-point error factor. <a href="structsmall__gicp_1_1GICPFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1ICPFactor.html">ICPFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Point-to-point per-point error factor. <a href="structsmall__gicp_1_1ICPFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1PointToPlaneICPFactor.html">PointToPlaneICPFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Point-to-plane per-point error factor. <a href="structsmall__gicp_1_1PointToPlaneICPFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1Huber.html">Huber</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1Huber.html" title="Huber robust kernel.">Huber</a> robust kernel. <a href="structsmall__gicp_1_1Huber.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1Cauchy.html">Cauchy</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1Cauchy.html" title="Cauchy robust kernel.">Cauchy</a> robust kernel. <a href="structsmall__gicp_1_1Cauchy.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1RobustFactor.html">RobustFactor</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Robustify a factor with a robust kernel. <a href="structsmall__gicp_1_1RobustFactor.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1PointCloudProxy.html">PointCloudProxy</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Proxy class to access PCL point cloud with external covariance matrices. <a href="structsmall__gicp_1_1PointCloudProxy.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classsmall__gicp_1_1RegistrationPCL.html">RegistrationPCL</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">PCL registration interfaces. <a href="classsmall__gicp_1_1RegistrationPCL.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Point cloud. <a href="structsmall__gicp_1_1PointCloud.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1GaussNewtonOptimizer.html">GaussNewtonOptimizer</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">GaussNewton optimizer. <a href="structsmall__gicp_1_1GaussNewtonOptimizer.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1LevenbergMarquardtOptimizer.html">LevenbergMarquardtOptimizer</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">LevenbergMarquardt optimizer. <a href="structsmall__gicp_1_1LevenbergMarquardtOptimizer.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1SerialReduction.html">SerialReduction</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Single-thread reduction. <a href="structsmall__gicp_1_1SerialReduction.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1ParallelReductionOMP.html">ParallelReductionOMP</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parallel reduction with OpenMP backend. <a href="structsmall__gicp_1_1ParallelReductionOMP.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1LinearizeSum.html">LinearizeSum</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Summation for linearized systems. <a href="structsmall__gicp_1_1LinearizeSum.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1ErrorSum.html">ErrorSum</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Summation for evaluated errors. <a href="structsmall__gicp_1_1ErrorSum.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1ParallelReductionTBB.html">ParallelReductionTBB</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parallel reduction with TBB backend. <a href="structsmall__gicp_1_1ParallelReductionTBB.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1Registration.html">Registration</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Point cloud registration. <a href="structsmall__gicp_1_1Registration.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> setting. <a href="structsmall__gicp_1_1RegistrationSetting.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> result. <a href="structsmall__gicp_1_1RegistrationResult.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1NullRejector.html">NullRejector</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Null correspondence rejector. This class accepts all input correspondences. <a href="structsmall__gicp_1_1NullRejector.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1DistanceRejector.html">DistanceRejector</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rejecting correspondences with large distances. <a href="structsmall__gicp_1_1DistanceRejector.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1TerminationCriteria.html">TerminationCriteria</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> termination criteria. <a href="structsmall__gicp_1_1TerminationCriteria.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1NormalSetter.html">NormalSetter</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes point normals from eigenvectors and sets them to the point cloud. <a href="structsmall__gicp_1_1NormalSetter.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1CovarianceSetter.html">CovarianceSetter</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes point covariances from eigenvectors and sets them to the point cloud. <a href="structsmall__gicp_1_1CovarianceSetter.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1NormalCovarianceSetter.html">NormalCovarianceSetter</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes point normals and covariances from eigenvectors and sets them to the point cloud. <a href="structsmall__gicp_1_1NormalCovarianceSetter.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1RadixSortBuffers.html">RadixSortBuffers</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Temporal buffers for radix sort. <a href="structsmall__gicp_1_1RadixSortBuffers.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsmall__gicp_1_1XORVector3iHash.html">XORVector3iHash</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Spatial hashing function. Teschner et al., "Optimized Spatial Hashing for Collision Detection of Deformable Objects", VMV2003. <a href="structsmall__gicp_1_1XORVector3iHash.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a55b1d2331cfcdfeaeb494862cb2390ae"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a55b1d2331cfcdfeaeb494862cb2390ae">FlatContainerPoints</a> = <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt; false, false &gt;</td></tr>
<tr class="memdesc:a55b1d2331cfcdfeaeb494862cb2390ae"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> that stores only points. <a href="namespacesmall__gicp.html#a55b1d2331cfcdfeaeb494862cb2390ae">More...</a><br /></td></tr>
<tr class="separator:a55b1d2331cfcdfeaeb494862cb2390ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aec427d082aeabc51dd991316f4e5b0ea"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aec427d082aeabc51dd991316f4e5b0ea">FlatContainerNormal</a> = <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt; true, false &gt;</td></tr>
<tr class="memdesc:aec427d082aeabc51dd991316f4e5b0ea"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with normals. <a href="namespacesmall__gicp.html#aec427d082aeabc51dd991316f4e5b0ea">More...</a><br /></td></tr>
<tr class="separator:aec427d082aeabc51dd991316f4e5b0ea"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a073a085485230911389f63d46e5547dd"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a073a085485230911389f63d46e5547dd">FlatContainerCov</a> = <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt; false, true &gt;</td></tr>
<tr class="memdesc:a073a085485230911389f63d46e5547dd"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with covariances. <a href="namespacesmall__gicp.html#a073a085485230911389f63d46e5547dd">More...</a><br /></td></tr>
<tr class="separator:a073a085485230911389f63d46e5547dd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0ce4510ed4baa8bc08f120c4a46fd12"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#ac0ce4510ed4baa8bc08f120c4a46fd12">FlatContainerNormalCov</a> = <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt; true, true &gt;</td></tr>
<tr class="memdesc:ac0ce4510ed4baa8bc08f120c4a46fd12"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with normals and covariances. <a href="namespacesmall__gicp.html#ac0ce4510ed4baa8bc08f120c4a46fd12">More...</a><br /></td></tr>
<tr class="separator:ac0ce4510ed4baa8bc08f120c4a46fd12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adaa11356e0b17e2958ad077dab99ea9c"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#adaa11356e0b17e2958ad077dab99ea9c">GaussianVoxelMap</a> = <a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html">IncrementalVoxelMap</a>&lt; <a class="el" href="structsmall__gicp_1_1GaussianVoxel.html">GaussianVoxel</a> &gt;</td></tr>
<tr class="separator:adaa11356e0b17e2958ad077dab99ea9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0fcc071f1f9cc9ea2f79068231c9053a"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a0fcc071f1f9cc9ea2f79068231c9053a">NodeIndexType</a> = std::uint32_t</td></tr>
<tr class="separator:a0fcc071f1f9cc9ea2f79068231c9053a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae507f2dc845993bd13809aa91b2a48bf"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#ae507f2dc845993bd13809aa91b2a48bf">omp_get_thread_num</a> ()</td></tr>
<tr class="separator:ae507f2dc845993bd13809aa91b2a48bf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a30d5bdb69c71e494dc85a8556faae960"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html#ae146e0c215d5e7d89a69cc8a1358f434">PointCloud::Ptr</a>, std::shared_ptr&lt; <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a30d5bdb69c71e494dc85a8556faae960">preprocess_points</a> (const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;points, double downsampling_resolution, int num_neighbors=10, int num_threads=4)</td></tr>
<tr class="memdesc:a30d5bdb69c71e494dc85a8556faae960"><td class="mdescLeft">&#160;</td><td class="mdescRight">Preprocess point cloud (downsampling, kdtree creation, and normal and covariance estimation). <a href="namespacesmall__gicp.html#a30d5bdb69c71e494dc85a8556faae960">More...</a><br /></td></tr>
<tr class="separator:a30d5bdb69c71e494dc85a8556faae960"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aae1dd13209cbd2d115f1a0f2e5561822"><td class="memTemplParams" colspan="2">template&lt;typename T , int D&gt; </td></tr>
<tr class="memitem:aae1dd13209cbd2d115f1a0f2e5561822"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html#ae146e0c215d5e7d89a69cc8a1358f434">PointCloud::Ptr</a>, std::shared_ptr&lt; <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aae1dd13209cbd2d115f1a0f2e5561822">preprocess_points</a> (const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;points, double downsampling_resolution, int num_neighbors=10, int num_threads=4)</td></tr>
<tr class="memdesc:aae1dd13209cbd2d115f1a0f2e5561822"><td class="mdescLeft">&#160;</td><td class="mdescRight">Preprocess point cloud (downsampling, kdtree creation, and normal and covariance estimation) <a href="namespacesmall__gicp.html#aae1dd13209cbd2d115f1a0f2e5561822">More...</a><br /></td></tr>
<tr class="separator:aae1dd13209cbd2d115f1a0f2e5561822"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a99e4cfa9b94a792b53670478502cabfe"><td class="memItemLeft" align="right" valign="top"><a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html#aa3359e10645a4a9418161590aa55fe0c">GaussianVoxelMap::Ptr</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a99e4cfa9b94a792b53670478502cabfe">create_gaussian_voxelmap</a> (const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;points, double voxel_resolution)</td></tr>
<tr class="memdesc:a99e4cfa9b94a792b53670478502cabfe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create an incremental Gaussian voxel map. <a href="namespacesmall__gicp.html#a99e4cfa9b94a792b53670478502cabfe">More...</a><br /></td></tr>
<tr class="separator:a99e4cfa9b94a792b53670478502cabfe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaaac24cfd2f82c7978ccc8cb66474cf4"><td class="memTemplParams" colspan="2">template&lt;typename T , int D&gt; </td></tr>
<tr class="memitem:aaaac24cfd2f82c7978ccc8cb66474cf4"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aaaac24cfd2f82c7978ccc8cb66474cf4">align</a> (const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;target, const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;source, const Eigen::Isometry3d &amp;init_T=Eigen::Isometry3d::Identity(), const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;setting=<a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>())</td></tr>
<tr class="memdesc:aaaac24cfd2f82c7978ccc8cb66474cf4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Align point clouds. <a href="namespacesmall__gicp.html#aaaac24cfd2f82c7978ccc8cb66474cf4">More...</a><br /></td></tr>
<tr class="separator:aaaac24cfd2f82c7978ccc8cb66474cf4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4f2f329a192d4effb0c81e15f28b8000"><td class="memItemLeft" align="right" valign="top"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a4f2f329a192d4effb0c81e15f28b8000">align</a> (const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;target, const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;source, const <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &gt; &amp;target_tree, const Eigen::Isometry3d &amp;init_T=Eigen::Isometry3d::Identity(), const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;setting=<a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>())</td></tr>
<tr class="memdesc:a4f2f329a192d4effb0c81e15f28b8000"><td class="mdescLeft">&#160;</td><td class="mdescRight">Align preprocessed point clouds. <a href="namespacesmall__gicp.html#a4f2f329a192d4effb0c81e15f28b8000">More...</a><br /></td></tr>
<tr class="separator:a4f2f329a192d4effb0c81e15f28b8000"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a165555d9cdfd6138f598538fbb07f194"><td class="memItemLeft" align="right" valign="top"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a165555d9cdfd6138f598538fbb07f194">align</a> (const <a class="el" href="namespacesmall__gicp.html#adaa11356e0b17e2958ad077dab99ea9c">GaussianVoxelMap</a> &amp;target, const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;source, const Eigen::Isometry3d &amp;init_T=Eigen::Isometry3d::Identity(), const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;setting=<a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>())</td></tr>
<tr class="memdesc:a165555d9cdfd6138f598538fbb07f194"><td class="mdescLeft">&#160;</td><td class="mdescRight">Align preprocessed point clouds with VGICP. <a href="namespacesmall__gicp.html#a165555d9cdfd6138f598538fbb07f194">More...</a><br /></td></tr>
<tr class="separator:a165555d9cdfd6138f598538fbb07f194"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1f96f233873fdc58bc241a8d26b0b774"><td class="memTemplParams" colspan="2">template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </td></tr>
<tr class="memitem:a1f96f233873fdc58bc241a8d26b0b774"><td class="memTemplItemLeft" align="right" valign="top">std::shared_ptr&lt; OutputPointCloud &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a1f96f233873fdc58bc241a8d26b0b774">voxelgrid_sampling</a> (const InputPointCloud &amp;points, double leaf_size)</td></tr>
<tr class="memdesc:a1f96f233873fdc58bc241a8d26b0b774"><td class="mdescLeft">&#160;</td><td class="mdescRight">Voxelgrid downsampling. This function computes exact average of points in each voxel, and each voxel can contain arbitrary number of points. <a href="namespacesmall__gicp.html#a1f96f233873fdc58bc241a8d26b0b774">More...</a><br /></td></tr>
<tr class="separator:a1f96f233873fdc58bc241a8d26b0b774"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9aafc25321a0484261582ac5160770ae"><td class="memTemplParams" colspan="2">template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud, typename RNG = std::mt19937&gt; </td></tr>
<tr class="memitem:a9aafc25321a0484261582ac5160770ae"><td class="memTemplItemLeft" align="right" valign="top">std::shared_ptr&lt; OutputPointCloud &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a9aafc25321a0484261582ac5160770ae">random_sampling</a> (const InputPointCloud &amp;points, size_t num_samples, RNG &amp;rng)</td></tr>
<tr class="memdesc:a9aafc25321a0484261582ac5160770ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Random downsampling. <a href="namespacesmall__gicp.html#a9aafc25321a0484261582ac5160770ae">More...</a><br /></td></tr>
<tr class="separator:a9aafc25321a0484261582ac5160770ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afedf95a15244b9cb2aa0e105b9a501ee"><td class="memTemplParams" colspan="2">template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </td></tr>
<tr class="memitem:afedf95a15244b9cb2aa0e105b9a501ee"><td class="memTemplItemLeft" align="right" valign="top">std::shared_ptr&lt; OutputPointCloud &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#afedf95a15244b9cb2aa0e105b9a501ee">voxelgrid_sampling_omp</a> (const InputPointCloud &amp;points, double leaf_size, int num_threads=4)</td></tr>
<tr class="memdesc:afedf95a15244b9cb2aa0e105b9a501ee"><td class="mdescLeft">&#160;</td><td class="mdescRight">Voxel grid downsampling with OpenMP backend. <a href="namespacesmall__gicp.html#afedf95a15244b9cb2aa0e105b9a501ee">More...</a><br /></td></tr>
<tr class="separator:afedf95a15244b9cb2aa0e105b9a501ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af99df9601fa3d294463327902f51669b"><td class="memTemplParams" colspan="2">template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </td></tr>
<tr class="memitem:af99df9601fa3d294463327902f51669b"><td class="memTemplItemLeft" align="right" valign="top">std::shared_ptr&lt; OutputPointCloud &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#af99df9601fa3d294463327902f51669b">voxelgrid_sampling_tbb</a> (const InputPointCloud &amp;points, double leaf_size)</td></tr>
<tr class="memdesc:af99df9601fa3d294463327902f51669b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Voxel grid downsampling with TBB backend. <a href="namespacesmall__gicp.html#af99df9601fa3d294463327902f51669b">More...</a><br /></td></tr>
<tr class="separator:af99df9601fa3d294463327902f51669b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa4cea49ae3c02a77305e4efdcf21280a"><td class="memItemLeft" align="right" valign="top">Eigen::Array4i&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aa4cea49ae3c02a77305e4efdcf21280a">fast_floor</a> (const Eigen::Array4d &amp;pt)</td></tr>
<tr class="memdesc:aa4cea49ae3c02a77305e4efdcf21280a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Fast floor (<a href="https://stackoverflow.com/questions/824118/why-is-floor-so-slow">https://stackoverflow.com/questions/824118/why-is-floor-so-slow</a>). <a href="namespacesmall__gicp.html#aa4cea49ae3c02a77305e4efdcf21280a">More...</a><br /></td></tr>
<tr class="separator:aa4cea49ae3c02a77305e4efdcf21280a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d86f81a31b152060f1b1f72585fdaf5"><td class="memItemLeft" align="right" valign="top">Eigen::Matrix3d&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a5d86f81a31b152060f1b1f72585fdaf5">skew</a> (const Eigen::Vector3d &amp;x)</td></tr>
<tr class="memdesc:a5d86f81a31b152060f1b1f72585fdaf5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Create skew symmetric matrix. <a href="namespacesmall__gicp.html#a5d86f81a31b152060f1b1f72585fdaf5">More...</a><br /></td></tr>
<tr class="separator:a5d86f81a31b152060f1b1f72585fdaf5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5c5f249a06b1a660d2e519a9936da3f7"><td class="memItemLeft" align="right" valign="top">Eigen::Quaterniond&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a5c5f249a06b1a660d2e519a9936da3f7">so3_exp</a> (const Eigen::Vector3d &amp;omega)</td></tr>
<tr class="memdesc:a5c5f249a06b1a660d2e519a9936da3f7"><td class="mdescLeft">&#160;</td><td class="mdescRight">SO3 expmap. <a href="namespacesmall__gicp.html#a5c5f249a06b1a660d2e519a9936da3f7">More...</a><br /></td></tr>
<tr class="separator:a5c5f249a06b1a660d2e519a9936da3f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0eae106c70deac5c20205c70c4bdaf3c"><td class="memItemLeft" align="right" valign="top">Eigen::Isometry3d&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a0eae106c70deac5c20205c70c4bdaf3c">se3_exp</a> (const Eigen::Matrix&lt; double, 6, 1 &gt; &amp;a)</td></tr>
<tr class="memdesc:a0eae106c70deac5c20205c70c4bdaf3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">SE3 expmap (Rotation-first). <a href="namespacesmall__gicp.html#a0eae106c70deac5c20205c70c4bdaf3c">More...</a><br /></td></tr>
<tr class="separator:a0eae106c70deac5c20205c70c4bdaf3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a501687927eb1e20bc346907c925f9d7d"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud , typename Tree &gt; </td></tr>
<tr class="memitem:a501687927eb1e20bc346907c925f9d7d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a501687927eb1e20bc346907c925f9d7d">estimate_local_features</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, Tree &amp;kdtree, int num_neighbors, size_t point_index)</td></tr>
<tr class="separator:a501687927eb1e20bc346907c925f9d7d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94b5c528b2407e7892765d500ac4bc68"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a94b5c528b2407e7892765d500ac4bc68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a94b5c528b2407e7892765d500ac4bc68">estimate_local_features</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, const <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors)</td></tr>
<tr class="separator:a94b5c528b2407e7892765d500ac4bc68"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a429f8aa891c416007816c83a09566600"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud &gt; </td></tr>
<tr class="memitem:a429f8aa891c416007816c83a09566600"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a429f8aa891c416007816c83a09566600">estimate_local_features</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors)</td></tr>
<tr class="separator:a429f8aa891c416007816c83a09566600"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0dbfb10fa4698c80cda854ceb6561e50"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a0dbfb10fa4698c80cda854ceb6561e50"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a0dbfb10fa4698c80cda854ceb6561e50">estimate_normals</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:a0dbfb10fa4698c80cda854ceb6561e50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals. <a href="namespacesmall__gicp.html#a0dbfb10fa4698c80cda854ceb6561e50">More...</a><br /></td></tr>
<tr class="separator:a0dbfb10fa4698c80cda854ceb6561e50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af962c06fc787c664b3647b53ec05d3d4"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:af962c06fc787c664b3647b53ec05d3d4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#af962c06fc787c664b3647b53ec05d3d4">estimate_normals</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:af962c06fc787c664b3647b53ec05d3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals. <a href="namespacesmall__gicp.html#af962c06fc787c664b3647b53ec05d3d4">More...</a><br /></td></tr>
<tr class="separator:af962c06fc787c664b3647b53ec05d3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a273f7ce3257fad200bcf76d2f2357d34"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a273f7ce3257fad200bcf76d2f2357d34"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a273f7ce3257fad200bcf76d2f2357d34">estimate_covariances</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:a273f7ce3257fad200bcf76d2f2357d34"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances. <a href="namespacesmall__gicp.html#a273f7ce3257fad200bcf76d2f2357d34">More...</a><br /></td></tr>
<tr class="separator:a273f7ce3257fad200bcf76d2f2357d34"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a45e5a9a3ca76f402d8203c9d0c9d341b"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a45e5a9a3ca76f402d8203c9d0c9d341b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a45e5a9a3ca76f402d8203c9d0c9d341b">estimate_covariances</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:a45e5a9a3ca76f402d8203c9d0c9d341b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances. <a href="namespacesmall__gicp.html#a45e5a9a3ca76f402d8203c9d0c9d341b">More...</a><br /></td></tr>
<tr class="separator:a45e5a9a3ca76f402d8203c9d0c9d341b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1be100924358411fa177c79973642b1b"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a1be100924358411fa177c79973642b1b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a1be100924358411fa177c79973642b1b">estimate_normals_covariances</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:a1be100924358411fa177c79973642b1b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances. <a href="namespacesmall__gicp.html#a1be100924358411fa177c79973642b1b">More...</a><br /></td></tr>
<tr class="separator:a1be100924358411fa177c79973642b1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a15382a59a6d46a77bf335387fb81477d"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a15382a59a6d46a77bf335387fb81477d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a15382a59a6d46a77bf335387fb81477d">estimate_normals_covariances</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:a15382a59a6d46a77bf335387fb81477d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances. <a href="namespacesmall__gicp.html#a15382a59a6d46a77bf335387fb81477d">More...</a><br /></td></tr>
<tr class="separator:a15382a59a6d46a77bf335387fb81477d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a029e1e8224da1a270fb547a06155ad79"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud &gt; </td></tr>
<tr class="memitem:a029e1e8224da1a270fb547a06155ad79"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a029e1e8224da1a270fb547a06155ad79">estimate_local_features_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors, int num_threads)</td></tr>
<tr class="separator:a029e1e8224da1a270fb547a06155ad79"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a38cc32a3601cb35feaeeca061ebf043c"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a38cc32a3601cb35feaeeca061ebf043c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a38cc32a3601cb35feaeeca061ebf043c">estimate_local_features_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors, int num_threads)</td></tr>
<tr class="separator:a38cc32a3601cb35feaeeca061ebf043c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a27c3fd7738e24b14f18bd5d4723275a9"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a27c3fd7738e24b14f18bd5d4723275a9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a27c3fd7738e24b14f18bd5d4723275a9">estimate_normals_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:a27c3fd7738e24b14f18bd5d4723275a9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals with OpenMP. <a href="namespacesmall__gicp.html#a27c3fd7738e24b14f18bd5d4723275a9">More...</a><br /></td></tr>
<tr class="separator:a27c3fd7738e24b14f18bd5d4723275a9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aefbe0a08b752e2c4d187406e33926b16"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:aefbe0a08b752e2c4d187406e33926b16"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aefbe0a08b752e2c4d187406e33926b16">estimate_normals_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:aefbe0a08b752e2c4d187406e33926b16"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals with OpenMP. <a href="namespacesmall__gicp.html#aefbe0a08b752e2c4d187406e33926b16">More...</a><br /></td></tr>
<tr class="separator:aefbe0a08b752e2c4d187406e33926b16"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adf8333664b03248cbcb20a9f17346b72"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:adf8333664b03248cbcb20a9f17346b72"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#adf8333664b03248cbcb20a9f17346b72">estimate_covariances_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:adf8333664b03248cbcb20a9f17346b72"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances with OpenMP. <a href="namespacesmall__gicp.html#adf8333664b03248cbcb20a9f17346b72">More...</a><br /></td></tr>
<tr class="separator:adf8333664b03248cbcb20a9f17346b72"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a961795840ac85cd4c2f8180af8a660c0"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a961795840ac85cd4c2f8180af8a660c0"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a961795840ac85cd4c2f8180af8a660c0">estimate_covariances_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:a961795840ac85cd4c2f8180af8a660c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances with OpenMP. <a href="namespacesmall__gicp.html#a961795840ac85cd4c2f8180af8a660c0">More...</a><br /></td></tr>
<tr class="separator:a961795840ac85cd4c2f8180af8a660c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9532a70de332d497b8fc9a0f75abdbf7"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a9532a70de332d497b8fc9a0f75abdbf7"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a9532a70de332d497b8fc9a0f75abdbf7">estimate_normals_covariances_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:a9532a70de332d497b8fc9a0f75abdbf7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances with OpenMP. <a href="namespacesmall__gicp.html#a9532a70de332d497b8fc9a0f75abdbf7">More...</a><br /></td></tr>
<tr class="separator:a9532a70de332d497b8fc9a0f75abdbf7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a31a6fc72889826267f8db3c39b76d5a5"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a31a6fc72889826267f8db3c39b76d5a5"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a31a6fc72889826267f8db3c39b76d5a5">estimate_normals_covariances_omp</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20, int num_threads=4)</td></tr>
<tr class="memdesc:a31a6fc72889826267f8db3c39b76d5a5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances with OpenMP. <a href="namespacesmall__gicp.html#a31a6fc72889826267f8db3c39b76d5a5">More...</a><br /></td></tr>
<tr class="separator:a31a6fc72889826267f8db3c39b76d5a5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a40bbe12c440d6f144e15e73128418237"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a40bbe12c440d6f144e15e73128418237"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a40bbe12c440d6f144e15e73128418237">estimate_local_features_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors)</td></tr>
<tr class="separator:a40bbe12c440d6f144e15e73128418237"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:accf40c75aa6326ba3ba8c85b733bba6d"><td class="memTemplParams" colspan="2">template&lt;typename Setter , typename PointCloud &gt; </td></tr>
<tr class="memitem:accf40c75aa6326ba3ba8c85b733bba6d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#accf40c75aa6326ba3ba8c85b733bba6d">estimate_local_features_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors)</td></tr>
<tr class="separator:accf40c75aa6326ba3ba8c85b733bba6d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2eac24e628e90858eaedc86e01322c0"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:ac2eac24e628e90858eaedc86e01322c0"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#ac2eac24e628e90858eaedc86e01322c0">estimate_normals_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:ac2eac24e628e90858eaedc86e01322c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals with TBB. <a href="namespacesmall__gicp.html#ac2eac24e628e90858eaedc86e01322c0">More...</a><br /></td></tr>
<tr class="separator:ac2eac24e628e90858eaedc86e01322c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a769f42f0a105216f40d028a19934ad51"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a769f42f0a105216f40d028a19934ad51"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a769f42f0a105216f40d028a19934ad51">estimate_normals_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:a769f42f0a105216f40d028a19934ad51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals with TBB. <a href="namespacesmall__gicp.html#a769f42f0a105216f40d028a19934ad51">More...</a><br /></td></tr>
<tr class="separator:a769f42f0a105216f40d028a19934ad51"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2984ef6c86de9c245e68717de21177c1"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:a2984ef6c86de9c245e68717de21177c1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a2984ef6c86de9c245e68717de21177c1">estimate_covariances_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:a2984ef6c86de9c245e68717de21177c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances with TBB. <a href="namespacesmall__gicp.html#a2984ef6c86de9c245e68717de21177c1">More...</a><br /></td></tr>
<tr class="separator:a2984ef6c86de9c245e68717de21177c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a90803b9a6f4abcc1d1ce4e55d14745ca"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a90803b9a6f4abcc1d1ce4e55d14745ca"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a90803b9a6f4abcc1d1ce4e55d14745ca">estimate_covariances_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:a90803b9a6f4abcc1d1ce4e55d14745ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point covariances with TBB. <a href="namespacesmall__gicp.html#a90803b9a6f4abcc1d1ce4e55d14745ca">More...</a><br /></td></tr>
<tr class="separator:a90803b9a6f4abcc1d1ce4e55d14745ca"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab420344af77cce8d3345b1d36dd6ed12"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud &gt; </td></tr>
<tr class="memitem:ab420344af77cce8d3345b1d36dd6ed12"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#ab420344af77cce8d3345b1d36dd6ed12">estimate_normals_covariances_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, int num_neighbors=20)</td></tr>
<tr class="memdesc:ab420344af77cce8d3345b1d36dd6ed12"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances with TBB. <a href="namespacesmall__gicp.html#ab420344af77cce8d3345b1d36dd6ed12">More...</a><br /></td></tr>
<tr class="separator:ab420344af77cce8d3345b1d36dd6ed12"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7a3c4ec69d8f168e7581134bd417cbc9"><td class="memTemplParams" colspan="2">template&lt;typename PointCloud , typename KdTree &gt; </td></tr>
<tr class="memitem:a7a3c4ec69d8f168e7581134bd417cbc9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a7a3c4ec69d8f168e7581134bd417cbc9">estimate_normals_covariances_tbb</a> (<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;cloud, <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;kdtree, int num_neighbors=20)</td></tr>
<tr class="memdesc:a7a3c4ec69d8f168e7581134bd417cbc9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Estimate point normals and covariances with TBB. <a href="namespacesmall__gicp.html#a7a3c4ec69d8f168e7581134bd417cbc9">More...</a><br /></td></tr>
<tr class="separator:a7a3c4ec69d8f168e7581134bd417cbc9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a32dc0ab954d5744d37183747a2356476"><td class="memTemplParams" colspan="2">template&lt;typename RandomAccessIterator , typename Compare &gt; </td></tr>
<tr class="memitem:a32dc0ab954d5744d37183747a2356476"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a32dc0ab954d5744d37183747a2356476">merge_sort_omp_impl</a> (RandomAccessIterator first, RandomAccessIterator last, const Compare &amp;comp)</td></tr>
<tr class="memdesc:a32dc0ab954d5744d37183747a2356476"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of merge sort with OpenMP parallelism. Do not call this directly. Use merge_sort_omp instead. <a href="namespacesmall__gicp.html#a32dc0ab954d5744d37183747a2356476">More...</a><br /></td></tr>
<tr class="separator:a32dc0ab954d5744d37183747a2356476"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aceb1d8349e6c67a22d37c7bfda7e6d3b"><td class="memTemplParams" colspan="2">template&lt;typename RandomAccessIterator , typename Compare &gt; </td></tr>
<tr class="memitem:aceb1d8349e6c67a22d37c7bfda7e6d3b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#aceb1d8349e6c67a22d37c7bfda7e6d3b">merge_sort_omp</a> (RandomAccessIterator first, RandomAccessIterator last, const Compare &amp;comp, int num_threads)</td></tr>
<tr class="memdesc:aceb1d8349e6c67a22d37c7bfda7e6d3b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Merge sort with OpenMP parallelism. <a href="namespacesmall__gicp.html#aceb1d8349e6c67a22d37c7bfda7e6d3b">More...</a><br /></td></tr>
<tr class="separator:aceb1d8349e6c67a22d37c7bfda7e6d3b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d3e11647aed6d5f464a3daf45586a1b"><td class="memTemplParams" colspan="2">template&lt;typename RandomAccessIterator , typename Compare &gt; </td></tr>
<tr class="memitem:a5d3e11647aed6d5f464a3daf45586a1b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a5d3e11647aed6d5f464a3daf45586a1b">quick_sort_omp_impl</a> (RandomAccessIterator first, RandomAccessIterator last, const Compare &amp;comp)</td></tr>
<tr class="memdesc:a5d3e11647aed6d5f464a3daf45586a1b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of quick sort with OpenMP parallelism. Do not call this directly. Use quick_sort_omp instead. <a href="namespacesmall__gicp.html#a5d3e11647aed6d5f464a3daf45586a1b">More...</a><br /></td></tr>
<tr class="separator:a5d3e11647aed6d5f464a3daf45586a1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a96f8d8685abd1a79630e0ca7b34bd50f"><td class="memTemplParams" colspan="2">template&lt;typename RandomAccessIterator , typename Compare &gt; </td></tr>
<tr class="memitem:a96f8d8685abd1a79630e0ca7b34bd50f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a96f8d8685abd1a79630e0ca7b34bd50f">quick_sort_omp</a> (RandomAccessIterator first, RandomAccessIterator last, const Compare &amp;comp, int num_threads)</td></tr>
<tr class="memdesc:a96f8d8685abd1a79630e0ca7b34bd50f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Quick sort with OpenMP parallelism. <a href="namespacesmall__gicp.html#a96f8d8685abd1a79630e0ca7b34bd50f">More...</a><br /></td></tr>
<tr class="separator:a96f8d8685abd1a79630e0ca7b34bd50f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a32f0523ba72ba84906680696221f61b9"><td class="memTemplParams" colspan="2">template&lt;typename T , typename KeyFunc , int bits = 8, int tile_size = 256&gt; </td></tr>
<tr class="memitem:a32f0523ba72ba84906680696221f61b9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#a32f0523ba72ba84906680696221f61b9">radix_sort_tbb</a> (T *first_, T *last_, const KeyFunc &amp;key_, <a class="el" href="structsmall__gicp_1_1RadixSortBuffers.html">RadixSortBuffers</a>&lt; T &gt; &amp;buffers)</td></tr>
<tr class="memdesc:a32f0523ba72ba84906680696221f61b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Radix sort with TBB parallelization. <a href="namespacesmall__gicp.html#a32f0523ba72ba84906680696221f61b9">More...</a><br /></td></tr>
<tr class="separator:a32f0523ba72ba84906680696221f61b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adede4866e7e22d9f0494e3d3c00de1a3"><td class="memTemplParams" colspan="2">template&lt;typename T , typename KeyFunc , int bits = 4, int tile_size = 256&gt; </td></tr>
<tr class="memitem:adede4866e7e22d9f0494e3d3c00de1a3"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacesmall__gicp.html#adede4866e7e22d9f0494e3d3c00de1a3">radix_sort_tbb</a> (T *first_, T *last_, const KeyFunc &amp;key_)</td></tr>
<tr class="memdesc:adede4866e7e22d9f0494e3d3c00de1a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Radix sort with TBB parallelization. <a href="namespacesmall__gicp.html#adede4866e7e22d9f0494e3d3c00de1a3">More...</a><br /></td></tr>
<tr class="separator:adede4866e7e22d9f0494e3d3c00de1a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<h2 class="groupheader">Typedef Documentation</h2>
<a id="a073a085485230911389f63d46e5547dd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a073a085485230911389f63d46e5547dd">&#9670;&nbsp;</a></span>FlatContainerCov</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#a073a085485230911389f63d46e5547dd">small_gicp::FlatContainerCov</a> = typedef <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt;false, true&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with covariances. </p>
</div>
</div>
<a id="aec427d082aeabc51dd991316f4e5b0ea"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aec427d082aeabc51dd991316f4e5b0ea">&#9670;&nbsp;</a></span>FlatContainerNormal</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#aec427d082aeabc51dd991316f4e5b0ea">small_gicp::FlatContainerNormal</a> = typedef <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt;true, false&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with normals. </p>
</div>
</div>
<a id="ac0ce4510ed4baa8bc08f120c4a46fd12"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac0ce4510ed4baa8bc08f120c4a46fd12">&#9670;&nbsp;</a></span>FlatContainerNormalCov</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#ac0ce4510ed4baa8bc08f120c4a46fd12">small_gicp::FlatContainerNormalCov</a> = typedef <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt;true, true&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> with normals and covariances. </p>
</div>
</div>
<a id="a55b1d2331cfcdfeaeb494862cb2390ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a55b1d2331cfcdfeaeb494862cb2390ae">&#9670;&nbsp;</a></span>FlatContainerPoints</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#a55b1d2331cfcdfeaeb494862cb2390ae">small_gicp::FlatContainerPoints</a> = typedef <a class="el" href="structsmall__gicp_1_1FlatContainer.html">FlatContainer</a>&lt;false, false&gt;</td>
</tr>
</table>
</div><div class="memdoc">
<p><a class="el" href="structsmall__gicp_1_1FlatContainer.html" title="Point container with a flat vector.">FlatContainer</a> that stores only points. </p>
</div>
</div>
<a id="adaa11356e0b17e2958ad077dab99ea9c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adaa11356e0b17e2958ad077dab99ea9c">&#9670;&nbsp;</a></span>GaussianVoxelMap</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#adaa11356e0b17e2958ad077dab99ea9c">small_gicp::GaussianVoxelMap</a> = typedef <a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html">IncrementalVoxelMap</a>&lt;<a class="el" href="structsmall__gicp_1_1GaussianVoxel.html">GaussianVoxel</a>&gt;</td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a0fcc071f1f9cc9ea2f79068231c9053a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0fcc071f1f9cc9ea2f79068231c9053a">&#9670;&nbsp;</a></span>NodeIndexType</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using <a class="el" href="namespacesmall__gicp.html#a0fcc071f1f9cc9ea2f79068231c9053a">small_gicp::NodeIndexType</a> = typedef std::uint32_t</td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a165555d9cdfd6138f598538fbb07f194"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a165555d9cdfd6138f598538fbb07f194">&#9670;&nbsp;</a></span>align() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a> small_gicp::align </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="namespacesmall__gicp.html#adaa11356e0b17e2958ad077dab99ea9c">GaussianVoxelMap</a> &amp;&#160;</td>
<td class="paramname"><em>target</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Eigen::Isometry3d &amp;&#160;</td>
<td class="paramname"><em>init_T</em> = <code>Eigen::Isometry3d::Identity()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;&#160;</td>
<td class="paramname"><em>setting</em> = <code><a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>()</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Align preprocessed point clouds with VGICP. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">target</td><td>Target Gaussian voxelmap </td></tr>
<tr><td class="paramname">source</td><td>Source point cloud </td></tr>
<tr><td class="paramname">init_T</td><td>Initial guess of T_target_source </td></tr>
<tr><td class="paramname">setting</td><td><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> setting </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> result </dd></dl>
</div>
</div>
<a id="a4f2f329a192d4effb0c81e15f28b8000"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4f2f329a192d4effb0c81e15f28b8000">&#9670;&nbsp;</a></span>align() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a> small_gicp::align </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>target</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt; <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>target_tree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Eigen::Isometry3d &amp;&#160;</td>
<td class="paramname"><em>init_T</em> = <code>Eigen::Isometry3d::Identity()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;&#160;</td>
<td class="paramname"><em>setting</em> = <code><a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>()</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Align preprocessed point clouds. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">target</td><td>Target point cloud </td></tr>
<tr><td class="paramname">source</td><td>Source point cloud </td></tr>
<tr><td class="paramname">target_tree</td><td>Nearest neighbor search for the target point cloud </td></tr>
<tr><td class="paramname">init_T</td><td>Initial guess of T_target_source </td></tr>
<tr><td class="paramname">setting</td><td><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> setting </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> result </dd></dl>
</div>
</div>
<a id="aaaac24cfd2f82c7978ccc8cb66474cf4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aaaac24cfd2f82c7978ccc8cb66474cf4">&#9670;&nbsp;</a></span>align() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T , int D&gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="structsmall__gicp_1_1RegistrationResult.html">RegistrationResult</a> small_gicp::align </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;&#160;</td>
<td class="paramname"><em>target</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;&#160;</td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Eigen::Isometry3d &amp;&#160;</td>
<td class="paramname"><em>init_T</em> = <code>Eigen::Isometry3d::Identity()</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a> &amp;&#160;</td>
<td class="paramname"><em>setting</em> = <code><a class="el" href="structsmall__gicp_1_1RegistrationSetting.html">RegistrationSetting</a>()</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Align point clouds. </p>
<dl class="section note"><dt>Note</dt><dd>This function only accepts Eigen::Vector(3|4)(f|d) as input </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="namespacesmall__gicp.html#afedf95a15244b9cb2aa0e105b9a501ee" title="Voxel grid downsampling with OpenMP backend.">small_gicp::voxelgrid_sampling_omp</a>, <a class="el" href="namespacesmall__gicp.html#a9532a70de332d497b8fc9a0f75abdbf7" title="Estimate point normals and covariances with OpenMP.">small_gicp::estimate_normals_covariances_omp</a> </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">target</td><td>Target points </td></tr>
<tr><td class="paramname">source</td><td>Source points </td></tr>
<tr><td class="paramname">init_T</td><td>Initial guess of T_target_source </td></tr>
<tr><td class="paramname">setting</td><td><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> setting </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><a class="el" href="structsmall__gicp_1_1Registration.html" title="Point cloud registration.">Registration</a> result </dd></dl>
</div>
</div>
<a id="a99e4cfa9b94a792b53670478502cabfe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a99e4cfa9b94a792b53670478502cabfe">&#9670;&nbsp;</a></span>create_gaussian_voxelmap()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html#aa3359e10645a4a9418161590aa55fe0c">GaussianVoxelMap::Ptr</a> small_gicp::create_gaussian_voxelmap </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>voxel_resolution</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Create an incremental Gaussian voxel map. </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="structsmall__gicp_1_1IncrementalVoxelMap.html" title="Incremental voxelmap. This class supports incremental point cloud insertion and LRU-based voxel delet...">small_gicp::IncrementalVoxelMap</a> </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">voxel_resolution</td><td>Voxel resolution </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a273f7ce3257fad200bcf76d2f2357d34"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a273f7ce3257fad200bcf76d2f2357d34">&#9670;&nbsp;</a></span>estimate_covariances() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a45e5a9a3ca76f402d8203c9d0c9d341b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a45e5a9a3ca76f402d8203c9d0c9d341b">&#9670;&nbsp;</a></span>estimate_covariances() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="adf8333664b03248cbcb20a9f17346b72"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adf8333664b03248cbcb20a9f17346b72">&#9670;&nbsp;</a></span>estimate_covariances_omp() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a961795840ac85cd4c2f8180af8a660c0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a961795840ac85cd4c2f8180af8a660c0">&#9670;&nbsp;</a></span>estimate_covariances_omp() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a2984ef6c86de9c245e68717de21177c1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2984ef6c86de9c245e68717de21177c1">&#9670;&nbsp;</a></span>estimate_covariances_tbb() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a90803b9a6f4abcc1d1ce4e55d14745ca"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a90803b9a6f4abcc1d1ce4e55d14745ca">&#9670;&nbsp;</a></span>estimate_covariances_tbb() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_covariances_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point covariances with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a94b5c528b2407e7892765d500ac4bc68"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a94b5c528b2407e7892765d500ac4bc68">&#9670;&nbsp;</a></span>estimate_local_features() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a429f8aa891c416007816c83a09566600"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a429f8aa891c416007816c83a09566600">&#9670;&nbsp;</a></span>estimate_local_features() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a501687927eb1e20bc346907c925f9d7d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a501687927eb1e20bc346907c925f9d7d">&#9670;&nbsp;</a></span>estimate_local_features() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud , typename Tree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">Tree &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>point_index</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a029e1e8224da1a270fb547a06155ad79"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a029e1e8224da1a270fb547a06155ad79">&#9670;&nbsp;</a></span>estimate_local_features_omp() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a38cc32a3601cb35feaeeca061ebf043c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a38cc32a3601cb35feaeeca061ebf043c">&#9670;&nbsp;</a></span>estimate_local_features_omp() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="accf40c75aa6326ba3ba8c85b733bba6d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#accf40c75aa6326ba3ba8c85b733bba6d">&#9670;&nbsp;</a></span>estimate_local_features_tbb() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a40bbe12c440d6f144e15e73128418237"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a40bbe12c440d6f144e15e73128418237">&#9670;&nbsp;</a></span>estimate_local_features_tbb() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename Setter , typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_local_features_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a0dbfb10fa4698c80cda854ceb6561e50"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0dbfb10fa4698c80cda854ceb6561e50">&#9670;&nbsp;</a></span>estimate_normals() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="af962c06fc787c664b3647b53ec05d3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af962c06fc787c664b3647b53ec05d3d4">&#9670;&nbsp;</a></span>estimate_normals() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a1be100924358411fa177c79973642b1b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1be100924358411fa177c79973642b1b">&#9670;&nbsp;</a></span>estimate_normals_covariances() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a15382a59a6d46a77bf335387fb81477d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a15382a59a6d46a77bf335387fb81477d">&#9670;&nbsp;</a></span>estimate_normals_covariances() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a9532a70de332d497b8fc9a0f75abdbf7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9532a70de332d497b8fc9a0f75abdbf7">&#9670;&nbsp;</a></span>estimate_normals_covariances_omp() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a31a6fc72889826267f8db3c39b76d5a5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a31a6fc72889826267f8db3c39b76d5a5">&#9670;&nbsp;</a></span>estimate_normals_covariances_omp() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="ab420344af77cce8d3345b1d36dd6ed12"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab420344af77cce8d3345b1d36dd6ed12">&#9670;&nbsp;</a></span>estimate_normals_covariances_tbb() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a7a3c4ec69d8f168e7581134bd417cbc9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7a3c4ec69d8f168e7581134bd417cbc9">&#9670;&nbsp;</a></span>estimate_normals_covariances_tbb() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_covariances_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals and covariances with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a27c3fd7738e24b14f18bd5d4723275a9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a27c3fd7738e24b14f18bd5d4723275a9">&#9670;&nbsp;</a></span>estimate_normals_omp() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="aefbe0a08b752e2c4d187406e33926b16"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aefbe0a08b752e2c4d187406e33926b16">&#9670;&nbsp;</a></span>estimate_normals_omp() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_omp </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals with OpenMP. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="ac2eac24e628e90858eaedc86e01322c0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2eac24e628e90858eaedc86e01322c0">&#9670;&nbsp;</a></span>estimate_normals_tbb() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a769f42f0a105216f40d028a19934ad51"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a769f42f0a105216f40d028a19934ad51">&#9670;&nbsp;</a></span>estimate_normals_tbb() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename PointCloud , typename KdTree &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::estimate_normals_tbb </td>
<td>(</td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>cloud</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a> &amp;&#160;</td>
<td class="paramname"><em>kdtree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>20</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Estimate point normals with TBB. </p>
<dl class="section note"><dt>Note</dt><dd>If a sufficient number of neighbor points for normal/covariance estimation (5 points) is not found, an invalid normal/covariance is set to the point (normal=zero vector, covariance=identity matrix). </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">cloud</td><td>[in/out] Point cloud </td></tr>
<tr><td class="paramname">kdtree</td><td>Nearest neighbor search </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors used for attribute estimation </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="aa4cea49ae3c02a77305e4efdcf21280a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa4cea49ae3c02a77305e4efdcf21280a">&#9670;&nbsp;</a></span>fast_floor()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Eigen::Array4i small_gicp::fast_floor </td>
<td>(</td>
<td class="paramtype">const Eigen::Array4d &amp;&#160;</td>
<td class="paramname"><em>pt</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Fast floor (<a href="https://stackoverflow.com/questions/824118/why-is-floor-so-slow">https://stackoverflow.com/questions/824118/why-is-floor-so-slow</a>). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">pt</td><td>Double vector </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Floored int vector </dd></dl>
</div>
</div>
<a id="aceb1d8349e6c67a22d37c7bfda7e6d3b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aceb1d8349e6c67a22d37c7bfda7e6d3b">&#9670;&nbsp;</a></span>merge_sort_omp()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename RandomAccessIterator , typename Compare &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::merge_sort_omp </td>
<td>(</td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Compare &amp;&#160;</td>
<td class="paramname"><em>comp</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Merge sort with OpenMP parallelism. </p>
<dl class="section note"><dt>Note</dt><dd>This tends to be slower than quick_sort_omp. </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>First iterator </td></tr>
<tr><td class="paramname">last</td><td>Last iterator </td></tr>
<tr><td class="paramname">comp</td><td>Comparison function </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a32dc0ab954d5744d37183747a2356476"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a32dc0ab954d5744d37183747a2356476">&#9670;&nbsp;</a></span>merge_sort_omp_impl()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename RandomAccessIterator , typename Compare &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::merge_sort_omp_impl </td>
<td>(</td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Compare &amp;&#160;</td>
<td class="paramname"><em>comp</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Implementation of merge sort with OpenMP parallelism. Do not call this directly. Use merge_sort_omp instead. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>First iterator </td></tr>
<tr><td class="paramname">last</td><td>Last iterator </td></tr>
<tr><td class="paramname">comp</td><td>Comparison function </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="ae507f2dc845993bd13809aa91b2a48bf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae507f2dc845993bd13809aa91b2a48bf">&#9670;&nbsp;</a></span>omp_get_thread_num()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int small_gicp::omp_get_thread_num </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a id="a30d5bdb69c71e494dc85a8556faae960"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a30d5bdb69c71e494dc85a8556faae960">&#9670;&nbsp;</a></span>preprocess_points() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::pair&lt;<a class="el" href="structsmall__gicp_1_1PointCloud.html#ae146e0c215d5e7d89a69cc8a1358f434">PointCloud::Ptr</a>, std::shared_ptr&lt;<a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt;<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a>&gt; &gt; &gt; small_gicp::preprocess_points </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a> &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>downsampling_resolution</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>10</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Preprocess point cloud (downsampling, kdtree creation, and normal and covariance estimation). </p>
<dl class="section note"><dt>Note</dt><dd>When num_threads &gt;= 2, this function has minor run-by-run non-determinism due to the parallel downsampling. </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="namespacesmall__gicp.html#afedf95a15244b9cb2aa0e105b9a501ee" title="Voxel grid downsampling with OpenMP backend.">small_gicp::voxelgrid_sampling_omp</a>, <a class="el" href="namespacesmall__gicp.html#a9532a70de332d497b8fc9a0f75abdbf7" title="Estimate point normals and covariances with OpenMP.">small_gicp::estimate_normals_covariances_omp</a> </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">downsampling_resolution</td><td>Downsample resolution </td></tr>
<tr><td class="paramname">num_neighbors</td><td>Number of neighbors for normal/covariance estimation </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="aae1dd13209cbd2d115f1a0f2e5561822"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aae1dd13209cbd2d115f1a0f2e5561822">&#9670;&nbsp;</a></span>preprocess_points() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T , int D&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::pair&lt;<a class="el" href="structsmall__gicp_1_1PointCloud.html#ae146e0c215d5e7d89a69cc8a1358f434">PointCloud::Ptr</a>, std::shared_ptr&lt;<a class="el" href="structsmall__gicp_1_1KdTree.html">KdTree</a>&lt;<a class="el" href="structsmall__gicp_1_1PointCloud.html">PointCloud</a>&gt; &gt; &gt; small_gicp::preprocess_points </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; Eigen::Matrix&lt; T, D, 1 &gt;&gt; &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>downsampling_resolution</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_neighbors</em> = <code>10</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Preprocess point cloud (downsampling, kdtree creation, and normal and covariance estimation) </p>
<dl class="section note"><dt>Note</dt><dd>This function only accepts Eigen::Vector(3|4)(f|d) as input </dd>
<dd>
When num_threads &gt;= 2, this function has minor run-by-run non-determinism due to the parallel downsampling. </dd></dl>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="namespacesmall__gicp.html#afedf95a15244b9cb2aa0e105b9a501ee" title="Voxel grid downsampling with OpenMP backend.">small_gicp::voxelgrid_sampling_omp</a>, <a class="el" href="namespacesmall__gicp.html#a9532a70de332d497b8fc9a0f75abdbf7" title="Estimate point normals and covariances with OpenMP.">small_gicp::estimate_normals_covariances_omp</a> </dd></dl>
</div>
</div>
<a id="a96f8d8685abd1a79630e0ca7b34bd50f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a96f8d8685abd1a79630e0ca7b34bd50f">&#9670;&nbsp;</a></span>quick_sort_omp()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename RandomAccessIterator , typename Compare &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::quick_sort_omp </td>
<td>(</td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Compare &amp;&#160;</td>
<td class="paramname"><em>comp</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Quick sort with OpenMP parallelism. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>First iterator </td></tr>
<tr><td class="paramname">last</td><td>Last iterator </td></tr>
<tr><td class="paramname">comp</td><td>Comparison function </td></tr>
<tr><td class="paramname">num_threads</td><td>Number of threads </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a5d3e11647aed6d5f464a3daf45586a1b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5d3e11647aed6d5f464a3daf45586a1b">&#9670;&nbsp;</a></span>quick_sort_omp_impl()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename RandomAccessIterator , typename Compare &gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::quick_sort_omp_impl </td>
<td>(</td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">RandomAccessIterator&#160;</td>
<td class="paramname"><em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Compare &amp;&#160;</td>
<td class="paramname"><em>comp</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Implementation of quick sort with OpenMP parallelism. Do not call this directly. Use quick_sort_omp instead. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first</td><td>First iterator </td></tr>
<tr><td class="paramname">last</td><td>Last iterator </td></tr>
<tr><td class="paramname">comp</td><td>Comparison function </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="adede4866e7e22d9f0494e3d3c00de1a3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adede4866e7e22d9f0494e3d3c00de1a3">&#9670;&nbsp;</a></span>radix_sort_tbb() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T , typename KeyFunc , int bits = 4, int tile_size = 256&gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::radix_sort_tbb </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>first_</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>last_</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const KeyFunc &amp;&#160;</td>
<td class="paramname"><em>key_</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Radix sort with TBB parallelization. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>Data type (must be unsigned integral type) </td></tr>
<tr><td class="paramname">KeyFunc</td><td>Key function </td></tr>
<tr><td class="paramname">bits</td><td>Number of bits per step </td></tr>
<tr><td class="paramname">tile_size</td><td>Tile size </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first_</td><td>[in/out] First iterator </td></tr>
<tr><td class="paramname">last_</td><td>[in/out] Last iterator </td></tr>
<tr><td class="paramname">key_</td><td>Key function (T =&gt; uint) </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a32f0523ba72ba84906680696221f61b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a32f0523ba72ba84906680696221f61b9">&#9670;&nbsp;</a></span>radix_sort_tbb() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T , typename KeyFunc , int bits = 8, int tile_size = 256&gt; </div>
<table class="memname">
<tr>
<td class="memname">void small_gicp::radix_sort_tbb </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>first_</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>last_</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const KeyFunc &amp;&#160;</td>
<td class="paramname"><em>key_</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="structsmall__gicp_1_1RadixSortBuffers.html">RadixSortBuffers</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>buffers</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Radix sort with TBB parallelization. </p>
<dl class="section note"><dt>Note</dt><dd>This function outperforms tbb::parallel_sort only in case with many elements and threads. For usual data size and number of threads, use tbb::parallel_sort. </dd></dl>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>Data type (must be unsigned integral type) </td></tr>
<tr><td class="paramname">KeyFunc</td><td>Key function </td></tr>
<tr><td class="paramname">bits</td><td>Number of bits per step </td></tr>
<tr><td class="paramname">tile_size</td><td>Tile size </td></tr>
</table>
</dd>
</dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">first_</td><td>[in/out] First iterator </td></tr>
<tr><td class="paramname">last_</td><td>[in/out] Last iterator </td></tr>
<tr><td class="paramname">key_</td><td>Key function (T =&gt; uint) </td></tr>
<tr><td class="paramname">buffers</td><td>Temporal buffers </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a9aafc25321a0484261582ac5160770ae"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9aafc25321a0484261582ac5160770ae">&#9670;&nbsp;</a></span>random_sampling()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud, typename RNG = std::mt19937&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::shared_ptr&lt;OutputPointCloud&gt; small_gicp::random_sampling </td>
<td>(</td>
<td class="paramtype">const InputPointCloud &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>num_samples</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">RNG &amp;&#160;</td>
<td class="paramname"><em>rng</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Random downsampling. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">num_samples</td><td>Number of samples to be drawn </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Downsampled points </dd></dl>
</div>
</div>
<a id="a0eae106c70deac5c20205c70c4bdaf3c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0eae106c70deac5c20205c70c4bdaf3c">&#9670;&nbsp;</a></span>se3_exp()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Eigen::Isometry3d small_gicp::se3_exp </td>
<td>(</td>
<td class="paramtype">const Eigen::Matrix&lt; double, 6, 1 &gt; &amp;&#160;</td>
<td class="paramname"><em>a</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>SE3 expmap (Rotation-first). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>Twist vector [rx, ry, rz, tx, ty, tz] </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>SE3 matrix </dd></dl>
<p>Note: That is an accurate expansion!</p>
</div>
</div>
<a id="a5d86f81a31b152060f1b1f72585fdaf5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5d86f81a31b152060f1b1f72585fdaf5">&#9670;&nbsp;</a></span>skew()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Eigen::Matrix3d small_gicp::skew </td>
<td>(</td>
<td class="paramtype">const Eigen::Vector3d &amp;&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Create skew symmetric matrix. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>Rotation vector </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Skew symmetric matrix </dd></dl>
</div>
</div>
<a id="a5c5f249a06b1a660d2e519a9936da3f7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5c5f249a06b1a660d2e519a9936da3f7">&#9670;&nbsp;</a></span>so3_exp()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">Eigen::Quaterniond small_gicp::so3_exp </td>
<td>(</td>
<td class="paramtype">const Eigen::Vector3d &amp;&#160;</td>
<td class="paramname"><em>omega</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>SO3 expmap. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">omega</td><td>[rx, ry, rz] </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Quaternion </dd></dl>
</div>
</div>
<a id="a1f96f233873fdc58bc241a8d26b0b774"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f96f233873fdc58bc241a8d26b0b774">&#9670;&nbsp;</a></span>voxelgrid_sampling()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::shared_ptr&lt;OutputPointCloud&gt; small_gicp::voxelgrid_sampling </td>
<td>(</td>
<td class="paramtype">const InputPointCloud &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>leaf_size</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Voxelgrid downsampling. This function computes exact average of points in each voxel, and each voxel can contain arbitrary number of points. </p>
<dl class="section note"><dt>Note</dt><dd>Discretized voxel coords must be in 21bit range [-1048576, 1048575]. For example, if the downsampling resolution is 0.01 m, point coordinates must be in [-10485.76, 10485.75] m. Points outside the valid range will be ignored. </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">leaf_size</td><td>Downsampling resolution </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Downsampled points </dd></dl>
</div>
</div>
<a id="afedf95a15244b9cb2aa0e105b9a501ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afedf95a15244b9cb2aa0e105b9a501ee">&#9670;&nbsp;</a></span>voxelgrid_sampling_omp()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::shared_ptr&lt;OutputPointCloud&gt; small_gicp::voxelgrid_sampling_omp </td>
<td>(</td>
<td class="paramtype">const InputPointCloud &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>leaf_size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num_threads</em> = <code>4</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Voxel grid downsampling with OpenMP backend. </p>
<dl class="section note"><dt>Note</dt><dd>This function has minor run-by-run non-deterministic behavior due to parallel data collection that results in a deviation of the number of points in the downsampling results (up to 10% increase from the single-thread version). </dd>
<dd>
Discretized voxel coords must be in 21bit range [-1048576, 1048575]. For example, if the downsampling resolution is 0.01 m, point coordinates must be in [-10485.76, 10485.75] m. Points outside the valid range will be ignored. </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">leaf_size</td><td>Downsampling resolution </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Downsampled points </dd></dl>
</div>
</div>
<a id="af99df9601fa3d294463327902f51669b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af99df9601fa3d294463327902f51669b">&#9670;&nbsp;</a></span>voxelgrid_sampling_tbb()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename InputPointCloud , typename OutputPointCloud = InputPointCloud&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::shared_ptr&lt;OutputPointCloud&gt; small_gicp::voxelgrid_sampling_tbb </td>
<td>(</td>
<td class="paramtype">const InputPointCloud &amp;&#160;</td>
<td class="paramname"><em>points</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>leaf_size</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Voxel grid downsampling with TBB backend. </p>
<dl class="section note"><dt>Note</dt><dd>This function has minor run-by-run non-deterministic behavior due to parallel data collection that results in a deviation of the number of points in the downsampling results (up to 10% increase from the single-thread version). </dd>
<dd>
Discretized voxel coords must be in 21bit range [-1048576, 1048575]. For example, if the downsampling resolution is 0.01 m, point coordinates must be in [-10485.76, 10485.75] m. Points outside the valid range will be ignored. </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">points</td><td>Input points </td></tr>
<tr><td class="paramname">leaf_size</td><td>Downsampling resolution </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Downsampled points </dd></dl>
</div>
</div>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
</small></address>
</body>
</html>