基于cloudcompare构建的三维工件点云+配合偏差实时测量系统源码+项目说明（vs2017+qt联合开发）.zip

<center><h2>Adaptive Multigrid Solvers (Version 12.00)</h2></center> <center> <a href="#LINKS">links</a> <a href="#EXECUTABLES">executables</a> <a href="#USAGE">usage</a> <a href="#CHANGES">changes</a> <!-- <a href="#SUPPORT">support</a> --> </center> <hr> This code-base was born from the Poisson Surface Reconstruction code. It has evolved to support more general adaptive finite-elements systems: <UL> <LI> in spaces of arbitrary dimension, <LI> discretized using finite-elements of arbitrary degree, <LI> involving arbitrary function derivatives, <LI> with both point-wise and integrated constraints. </UL> <hr> <a name="LINKS"><b>LINKS</b></a><br> <ul> <b>Papers:</b> <a href="http://www.cs.jhu.edu/~misha/MyPapers/SGP06.pdf">[Kazhdan, Bolitho, and Hoppe, 2006]</a>, <a href="http://www.agarwala.org/efficient_gdc/">[Agarwala, 2007]</A> <a href="http://mesh.brown.edu/ssd/paper.html">[Calakli and Taubin, 2011]</a>, <A HREF="https://www.cs.cmu.edu/~kmcrane/Projects/HeatMethod/">[Crane, Weischedel, and Wardetzky, 2013]</a>, <a href="http://www.cs.jhu.edu/~misha/MyPapers/ToG13.pdf">[Kazhdan and Hoppe, 2013]</a> <br> <b>Executables: </b> <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version12.00/AdaptiveSolvers.x64.zip">Win64</a><br> <b>Source Code:</b> <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version12.00/AdaptiveSolvers.zip">ZIP</a> <a href="https://github.com/mkazhdan/PoissonRecon">GitHub</a><br> <b>Older Versions:</b> <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.02/">V11.02</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.01/">V11.01</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.00/">V11.00</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.07/">V10.07</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.06/">V10.06</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.05/">V10.05</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.04/">V10.04</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.03/">V10.03</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.02/">V10.02</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.01/">V10.01</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.00/">V10.00</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.011/">V9.011</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.01/">V9.01</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.0/">V9.0</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version8.0/">V8.0</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version7.0/">V7.0</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13a/">V6.13a</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13/">V6.13</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.12/">V6.12</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.11/">V6.11</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.1/">V6.1</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6/">V6</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.71/">V5.71</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.6/">V5.6</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.5a/">V5.5a</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.1/">V5.1</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5/">V5</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.51/">V4.51</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.5/">V4.5</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4/">V4</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version3/">V3</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version2/">V2</a>, <a href="http://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version1/">V1</a> </ul> <hr> <a name="EXECUTABLES"><b>EXECUTABLES</b></a><br> <ul> <dl> <DETAILS> <SUMMARY> <font size="+1"><b>PoissonRecon</b></font>: Reconstructs a triangle mesh from a set of oriented 3D points by solving a Poisson system (solving a 3D Laplacian system with positional value constraints) <a href="http://www.cs.jhu.edu/~misha/MyPapers/SGP06.pdf">[Kazhdan, Bolitho, and Hoppe, 2006]</a>, <a href="http://www.cs.jhu.edu/~misha/MyPapers/ToG13.pdf">[Kazhdan and Hoppe, 2013]</a> </SUMMARY> <dt><b>--in</b> &lt;<i>input points</i>&gt; </dt><dd> This string is the name of the file from which the point set will be read.<br> If the file extension is <i>.ply</i>, the file should be in <a href="http://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format, giving the list of oriented vertices with the x-, y-, and z-coordinates of the positions encoded by the properties <i>x</i>, <i>y</i>, and <i>z</i> and the x-, y-, and z-coordinates of the normals encoded by the properties <i>nx</i>, <i>ny</i>, and <i>nz</i> .<br> If the file extension is <i>.bnpts</i>, the file should be a binary file, consisting of blocks of 6 32-bit floats: x-, y-, and z-coordinates of the point's position, followed by the x-, y-, and z-coordinates of the point's normal. (No information about the number of oriented point samples should be specified.)<br> Otherwise, the file should be an ascii file with groups of 6, white space delimited, numbers: x-, y-, and z-coordinates of the point's position, followed by the x-, y- and z-coordinates of the point's normal. (No information about the number of oriented point samples should be specified.)<br> </dd><dt>[<b>--out</b> &lt;<i>output triangle mesh</i>&gt;] </dt><dd> This string is the name of the file to which the triangle mesh will be written. The file is written in <a href="http://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[<b>--tree</b> &lt;<i>output octree and coefficients</i>&gt;] </dt><dd> This string is the name of the file to which the the octree and solution coefficients are to be written. </dd><dt>[<b>--grid</b> &lt;<i>output grid</i>&gt;] </dt><dd> This string is the name of the file to which the sampled implicit function will be written. The file is written out in binary, with the first 4 bytes corresponding to the (integer) sampling resolution, 2^<i>d</i>, and the next 4 x 2^<i>d</i> x 2^<i>d</i> x ... bytes corresponding to the (single precision) floating point values of the implicit function. </dd><dt>[<b>--degree</b> &lt;<i>B-spline degree</i>&gt;] </dt><dd> This integer specifies the degree of the B-spline that is to be used to define the finite elements system. Larger degrees support higher order approximations, but come at the cost of denser system matrices (incurring a cost in both space and time).<br> The default value for this parameter is 2. </dd><dt>[<b>--bType</b> &lt;<i>boundary type</i>&gt;] </dt><dd> This integer specifies the boundary type for the finite elements. Valid values are: <ul> <li> <b>1</b>: Free boundary constraints </li><li> <b>2</b>: Dirichlet boundary constraints </li><li> <b>3</b>: Neumann boundary constraints </li></ul> The default value for this parameter is 3 (Neumann). </dd><dt>[<b>--depth</b> &lt;<i>reconstruction depth</i>&gt;] </dt><dd> This integer is the maximum depth of the tree that will be used for surface reconstruction. Running at depth <i>d</i> corresponds to solving on a grid whose resolution is no larger than 2^<i>d</i> x 2^<i>d</i> x ... Note that since the reconstructor adapts the octree to the sampling density, the specified reconstruction depth is only an upper bound.<br> The default value for this parameter is 8. </dd><dt>[<b>--width</b> &lt;<i>finest cell width</i>&gt;] </dt><dd> This floating point value specifies the target width of the finest level octree cells.<br> This parameter is ignored if the <B