Awesome

<center><h2>Adaptive Multigrid Solvers (Version 18.50)</h2></center> <center> <a href="#LINKS">links</a> <a href="#COMPILATION">compilation</a> <a href="#EXECUTABLES">executables</a> <a href="#LIBRARY">library</a> <a href="#USAGE">usage</a> <a href="#CHANGES">changes</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">LINKS</a> <ul> Papers: <a href="https://www.cs.jhu.edu/~misha/MyPapers/SGP06.pdf">[Kazhdan, Bolitho, and Hoppe, 2006]</a>, <a href="https://www.agarwala.org/efficient_gdc/">[Agarwala, 2007]</A> <a href="http://mesh.brown.edu/ssd/">[Calakli and Taubin, 2011]</a>, <A HREF="https://www.cs.cmu.edu/~kmcrane/Projects/HeatMethod/">[Crane, Weischedel, and Wardetzky, 2013]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/ToG13.pdf">[Kazhdan and Hoppe, 2013]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/CGF18.pdf">[Kazhdan and Hoppe, 2018]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/SGP20.pdf">[Kazhdan, Chuang, Rusinkiewicz, and Hoppe, 2020]</a> <a href="https://www.cs.jhu.edu/~misha/MyPapers/CGF23.pdf">[Kazhdan and Hoppe, 2023]</a> Executables: <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.50/AdaptiveSolvers.x64.zip">Win64</a> Source Code: <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.50/AdaptiveSolvers.zip">ZIP</a> <a href="https://github.com/mkazhdan/PoissonRecon">GitHub</a> Older Versions: <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.42/">V18.42</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.41/">V18.41</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.40/">V18.40</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.35/">V18.35</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.31/">V18.31</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.30/">V18.30</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.20/">V18.20</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.10/">V18.10</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.05/">V18.05</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.04/">V18.04</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.03/">V18.03</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.02/">V18.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.01/">V18.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.00/">V18.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version17.00/">V17.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.10/">V16.10</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.09/">V16.09</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.08/">V16.08</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.07/">V16.07</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.06/">V16.06</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.05/">V16.05</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.04/">V16.04</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.03/">V16.03</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.02/">V16.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.01/">V16.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.10/">V15.10</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.03/">V15.03</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.02/">V15.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.01/">V15.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.00/">V15.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.02/">V14.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.01/">V14.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.00/">V14.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.99/">V13.99</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.80/">V13.80</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.74/">V13.74</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.73/">V13.73</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.72/">V13.72</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.71/">V13.71</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.70/">V13.70</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.61/">V13.61</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.60/">V13.60</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.50/">V13.50</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.00/">V13.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version12.00/">V12.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.02/">V11.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.01/">V11.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.00/">V11.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.07/">V10.07</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.06/">V10.06</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.05/">V10.05</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.04/">V10.04</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.03/">V10.03</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.02/">V10.02</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.01/">V10.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.00/">V10.00</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.011/">V9.011</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.01/">V9.01</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.0/">V9.0</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version8.0/">V8.0</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version7.0/">V7.0</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13a/">V6.13a</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13/">V6.13</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.12/">V6.12</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.11/">V6.11</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.1/">V6.1</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6/">V6</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.71/">V5.71</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.6/">V5.6</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.5a/">V5.5a</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.1/">V5.1</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5/">V5</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.51/">V4.51</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.5/">V4.5</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4/">V4</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version3/">V3</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version2/">V2</a>, <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version1/">V1</a> </ul> <hr> <a name="COMPILATION">COMPILATION</a> <ul> <LI> For efficiency, the code is designed to compile for the specific FEM degree and boundary condition specified in PoissonRecon.h. (Specifically, DEFAULT_FEM_DEGREE is set to 1 and DEFAULT_FEM_BOUNDARY is set to Neumann.) You can change the default values in PoissonRecon.h. You can also compile the code so that it supports varying FEM degrees and boundary conditions by un-<CODE>#define</CODE>-ing FAST_COMPILE in PreProcess.h. However, this will make the compilation significantly slower. <LI> By default, the implementation assumes that all indexing can be done with 32-bit integers. If you are reconstructing large scenes and need more bits for indexing, you should enable the BIG_DATA flag in PreProcessor.h. Note that if the generated mesh has more primitives than can be indexed by a 32-bit integer, the output .ply file will store the integers using 64-bit precision (designated by the long long type) instead of the standard 32-bit precision (designated by the int type). Note that this is not a standard format and software like <A HREF="https://www.meshlab.net/">MeshLab</A> may not be able to read the file. <LI> The distributed PSR code uses sockets for communication between the client and the server. These are supported in a cross-platform way via <A HREF="https://www.boost.org">Boost</A>. (The code was developed and tested under Boost <A HREF="https://www.boost.org/users/history/version_1_80_0.html">version 1.80.0</A>.) <LI> To support reading/writing images, the code requires installation of the zlib, png, and jpg libraries. Source code for these is included for compilation using Visual Studios. The Makefile assumes that the header files can be found in /usr/local/include/ and that the library files can be found in /usr/local/lib/. </UL> </ul> <hr> <a name="EXECUTABLES">EXECUTABLES</a> <ul> <dl> <DETAILS> <SUMMARY> PoissonRecon: 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="https://www.cs.jhu.edu/~misha/MyPapers/SGP06.pdf">[Kazhdan, Bolitho, and Hoppe, 2006]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/ToG13.pdf">[Kazhdan and Hoppe, 2013]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/CGF18.pdf">[Kazhdan and Hoppe, 2018]</a>, <a href="https://www.cs.jhu.edu/~misha/MyPapers/SGP20.pdf">[Kazhdan, Chuang, Rusinkiewicz, and Hoppe, 2020]</a> </SUMMARY> <dt>--in <input points> </dt><dd> This string is the name of the file from which the point set will be read. If the file extension is .ply, the file should be in <a href="https://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 x, y, and z and the x-, y-, and z-coordinates of the normals encoded by the properties nx, ny, and nz . If the file extension is .bnpts, 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.) 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.) </dd> <dt>[--envelope <constraint envelope>] </dt><dd> This string is the name of the file from which the constraint envelope will be read. The file should be a water-tight triangle mesh in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format, oriented so that the normals are pointing in the direction that should be outside of the reconstructed surface. </dd><dt>[--out <output triangle mesh>] </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="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--tree <output octree and coefficients>] </dt><dd> This string is the name of the file to which the the octree and solution coefficients are to be written. </dd><dt>[--grid <output grid>] </dt><dd> This string is the name of the file to which the sampled implicit function will be written. The file consistes of seven header lines in ASCII describing the contents, following by the grid values in binary. <UL> <LI>The header looks like:<PRE><CODE>G3 1 FLOAT <RES_X> <RES_Y> <RES_Z> <M_00> <M_01> <M_02> <M_03> <M_10> <M_11> <M_12> <M_13> <M_20> <M_21> <M_22> <M_23> <M_30> <M_31> <M_22> <M_33> </CODE></PRE> The first two lines describe the contents of the file -- a 3D grid with a single floating point value per cell. The next line gives the resolution of the grid in <code>x</code>-, <code>y</code>-, and <code>z</code>-directions. The following four lines give the 4x4 coefficients of the homogenous transformation <CODE><M></CODE> taking grid-space coordinates to world-coordinates. <LI> The next 4 x <code><RES_X></code> x <code><RES_Y></code> x <code><RES_Z></code> bytes correspond to the (single precision) floating point values of the implicit function. </UL> </dd><dt>[--degree <B-spline degree>] </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). The default value for this parameter is 1. </dd><dt>[--bType <boundary type>] </dt><dd> This integer specifies the boundary type for the finite elements. Valid values are: <ul> <li> 1: Free boundary constraints </li><li> 2: Dirichlet boundary constraints </li><li> 3: Neumann boundary constraints </li></ul> The default value for this parameter is 3 (Neumann). </dd><dt>[--depth <reconstruction depth>] </dt><dd> This integer is the maximum depth of the tree that will be used for surface reconstruction. Running at depth d corresponds to solving on a grid whose resolution is no larger than 2^d x 2^d x ... Note that since the reconstructor adapts the octree to the sampling density, the specified reconstruction depth is only an upper bound. The default value for this parameter is 8. </dd><dt>[--width <finest cell width>] </dt><dd> This floating point value specifies the target width of the finest level octree cells. This parameter is ignored if the --depth is also specified. </dd><dt>[--scale <scale factor>] </dt><dd> This floating point value specifies the ratio between the diameter of the cube used for reconstruction and the diameter of the samples' bounding cube. The default value is 1.1. </dd><dt>[--samplesPerNode <minimum number of samples>] </dt><dd> This floating point value specifies the minimum number of sample points that should fall within an octree node as the octree construction is adapted to sampling density. For noise-free samples, small values in the range [1.0 - 5.0] can be used. For more noisy samples, larger values in the range [15.0 - 20.0] may be needed to provide a smoother, noise-reduced, reconstruction. The default value is 1.5. </dd><dt>[--pointWeight <interpolation weight>] </dt><dd> This floating point value specifies the importance that interpolation of the point samples is given in the formulation of the screened Poisson equation. The results of the original (unscreened) Poisson Reconstruction can be obtained by setting this value to 0. The default value for this parameter is twice the B-spline degree. </dd><dt>[--iters <Gauss-Seidel iterations per level>] </dt><dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the octree hierarchy. The default value for this parameter is 8. </dd><dt>[--density] </dt><dd> Enabling this flag tells the reconstructor to output the estimated depth values of the iso-surface vertices. </dd><dt>[--colors] </dt><dd> If the input points are in ASCII/binary format and contain color values, this flag lets the reconstruction code know that (1) each sample is represented by nine floating point values instead of the expected six, and that (2) color values should be output with the vertices of the reconstructed surface. (For input samples in the .ply format, the presence of color information, as well as any other additional per-sample data, is automatically determined from the file header.) </dd><dt>[--data <pull factor>] </dt><dd> If the input points have additional data (e.g. color) that is to be sampled at the output vertices, this floating point value specifies the relative importance of finer data over lower data in performing the extrapolation. The default value for this parameter is 32. </dd><dt>[--confidence <normal confidence exponent>] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to adjust its weight. (A point's confidence is defined by the magnitude of its normal.) The default value for this parameter is 0. </dd><dt>[--confidenceBias <normal confidence bias exponent>] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to bias the resolution at which the sample contributes to the linear system. (Points with lower confidence are biased to contribute at coarser resolutions.) The default value for this parameter is 0. </dd><dt>[--primalGrid] </dt><dd> Enabling this flag when outputing to a grid file has the reconstructor sample the implicit function at the corners of the grid, rather than the centers of the cells. </dd><dt>[--linearFit] </dt><dd> Enabling this flag has the reconstructor use linear interpolation to estimate the positions of iso-vertices. </dd><dt>[--polygonMesh] </dt><dd> Enabling this flag tells the reconstructor to output a polygon mesh (rather than triangulating the results of Marching Cubes). </dd><dt>[--tempDir <temporary output directory>] </dt><dd> This string is the name of the directory to which temporary files will be written. </dd><dt>[--threads <number of processing threads>] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd><dt>[--maxMemory <maximum memory usage (in GB)>] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the reconstruction code (forcing the execution to terminate if the limit is exceeded). </dd><dt>[--performance] </dt><dd> Enabling this flag provides running time and peak memory usage at the end of the execution. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the surface reconstructor. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PoissonReconServer: The server responsible for distributed Poisson Surface reconstruction  </SUMMARY> <dt>--in <input points></dt> <dd> This string is the name of the file from which the point set will be read. The file is assumed to be in binary <a href="https://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 x, y, and z and the x-, y-, and z-coordinates of the normals encoded by the properties nx, ny, and nz. (If additional properties, e.g. color, are provided per sample, these will be interpolated in the reconstruction.) </dd> <dt>--tempDir <networked temporary output directory></dt> <dd> This string is the name of the directory to which temporary files will be written. The specified (networked) path is assumed to accessible to the server and all clients. </dd> <dt>--out <output polygon mesh (header)></dt> <dd> This string is the name of the file to which the polygon mesh will be written (or the header, in the case --keepSeparate is specified). The file is written in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd> <dt>--count <client count></dt> <dd> This integer values specifies the number of clients that will be connecting to the server to peform the partitioning. </dd> <dt>[--port <listening port>]</dt> <dd> This optional integer specifies the port at which the server should listen for client requests. If no port is specified, the server will ask the system to provide one. Regardless of verbosity value, the server will print out the address and port to the command line. </dd> <dt>[--depth <reconstruction depth>=8] </dt><dd> This integer is the maximum depth of the tree that will be used for surface reconstruction. Running at depth d corresponds to solving on a grid whose resolution is no larger than 2^d x 2^d x ... Note that since the reconstructor adapts the octree to the sampling density, the specified reconstruction depth is only an upper bound. </dd> <dt>[--pDepth <partition/server depth>=5] </dt><dd> This integer is the depth of the tree at which the server performs the reconstruction and is also the depth at which the partitioning of the points happens. Running at a partition/server depth d corresponds to having the server solve over a grid whose resolution is 2^d x 2^d x ... and partitions the point set into 2^d slabs. </dd> <dt>[--width <finest cell width>] </dt><dd> This floating point value specifies the target width of the finest level octree cells. This parameter is ignored if the --depth flag is also specified. </dd> <dt>[--degree <B-spline degree>=1] </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). This option is only available if the code is compiled without the FAST_COMPILE flag <code>#define</code>-ed. </dd> <dt>[--bType <boundary type>=3] </dt><dd> This integer specifies the boundary type for the finite elements. Valid values are: <ul> <li> 1: Free boundary constraints </li><li> 2: Dirichlet boundary constraints </li><li> 3: Neumann boundary constraints </li></ul> This option is only available if the code is compiled without the FAST_COMPILE flag <code>#define</code>-ed. </dd> <dt>[--scale <scale factor>=1.1] </dt><dd> This floating point value specifies the ratio between the diameter of the cube used for reconstruction and the diameter of the samples' bounding cube. </dd> <dt>[--samplesPerNode <minimum number of samples>=1.5] </dt><dd> This floating point value specifies the minimum number of sample points that should fall within an octree node as the octree construction is adapted to sampling density. For noise-free samples, small values in the range [1.0 - 5.0] can be used. For more noisy samples, larger values in the range [15.0 - 20.0] may be needed to provide a smoother, noise-reduced, reconstruction. </dd> <dt>[--pointWeight <interpolation weight>=2*<B-spline degree>] </dt><dd> This floating point value specifies the importance that interpolation of the point samples is given in the formulation of the screened Poisson equation. The results of the original (unscreened) Poisson Reconstruction can be obtained by setting this value to 0. </dd> <dt>[--iters <Gauss-Seidel iterations per level>=8] </dt><dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the octree hierarchy. </dd> <dt>[--density] </dt><dd> Enabling this flag tells the reconstructor to output the estimated depth values of the iso-surface vertices. </dd> <dt>[--data <pull factor>=32] </dt><dd> If the input points have additional data (e.g. color) that is to be sampled at the output vertices, this floating point value specifies the relative importance of finer data over lower data in performing the extrapolation. </dd> <dt>[--confidence <normal confidence exponent>=0] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to adjust its weight. (A point's confidence is defined by the magnitude of its normal.) </dd> <dt>[--confidenceBias <normal confidence bias exponent>=0] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to bias the resolution at which the sample contributes to the linear system. (Points with lower confidence are biased to contribute at coarser resolutions.) </dd> <dt>[--verbose <verbosity>=0] </dt><dd> This integer value specifies the level of verbosity of output provided by the client and server, with "0" corresponding to no output and "4" giving the most. </dd> <dt>[--linearFit] </dt><dd> Enabling this flag has the reconstructor use linear interpolation to estimate the positions of iso-vertices. </dd> <dt>[--threads <number of processing threads>={number of (virtual) processors on the executing machine}] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. </dd> <dt>[--maxMemory <maximum memory usage (in GB)>] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the reconstruction code (forcing the execution to terminate if the limit is exceeded). The default value for this parameter is 0. </dd> </dd><dt>[--performance] </dt><dd> Enabling this flag provides running time and peak memory usage at the end of the execution. </dd> </dd><dt>[--noFuse] </dt><dd> Enabling this flag keeps the server from fusing shared vertices across slabs. (The reconstructions from the different clients will still be merged into a single .ply file.) </dd> </dd><dt>[--keepSeparate] </dt><dd> Enabling this flag keeps the reconstructions computed by the clients separate. In this case, the value of --out is treated as a header and the the geometries are output to files <code><output header>.<client index>.ply</code>. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PoissonReconClient: The client responsible for distributed Poisson Surface reconstruction  </SUMMARY> <dt>--port <server port></dt> <dd> This integer specifies the port at which to connect to the server. </dd> <dt>[--address <server address>="127.0.0.1"]</dt> <dd> This optional string specifies the IPv4 address of the server. </dd> <dt>[--multi <sub-client multiplicity>=1]</dt> <dd> This optional integer specifies the number of sub-clients the client should be running serially. </dd> <dt>[--threads <number of processing threads>={number of (virtual) processors on the executing machine}] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd> <dt>[--maxMemory <maximum memory usage (in GB)>=0] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the reconstruction code (forcing the execution to terminate if the limit is exceeded). </dd> </dd><dt>[--pause] </dt><dd> Enabling this flag has the client wait for the user to enter [ENTER] before closing the process. (Useful if the client is opened in a temporary window, you are running the client with verbose output, and want to see the output.) </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> SSDRecon: Reconstructs a surface mesh from a set of oriented 3D points by solving for a Smooth Signed Distance function (solving a 3D bi-Laplacian system with positional value and gradient constraints) <a href="http://mesh.brown.edu/ssd/">[Calakli and Taubin, 2011]</a> </SUMMARY> <dt>--in <input points> </dt><dd> This string is the name of the file from which the point set will be read. If the file extension is .ply, the file should be in <a href="https://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 x, y, and z and the x-, y-, and z-coordinates of the normals encoded by the properties nx, ny, and nz . If the file extension is .bnpts, 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.) 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.) </dd><dt>[--out <output triangle mesh>] </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="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--tree <output octree and coefficients>] </dt><dd> This string is the name of the file to which the the octree and solution coefficients are to be written. </dd><dt>[--grid <output grid>] </dt><dd> This string is the name of the file to which the sampled implicit function will be written. The file consistes of seven header lines in ASCII describing the contents, following by the grid values in binary. <UL> <LI>The header looks like:<PRE><CODE>G3 1 FLOAT <RES_X> <RES_Y> <RES_Z> <M_00> <M_01> <M_02> <M_03> <M_10> <M_11> <M_12> <M_13> <M_20> <M_21> <M_22> <M_23> <M_30> <M_31> <M_22> <M_33> </CODE></PRE> The first two lines describe the contents of the file -- a 3D grid with a single floating point value per cell. The next line gives the resolution of the grid in <code>x</code>-, <code>y</code>-, and <code>z</code>-directions. The following four lines give the 4x4 coefficients of the homogenous transformation <CODE><M></CODE> taking grid-space coordinates to world-coordinates. <LI> The next 4 x <code><RES_X></code> x <code><RES_Y></code> x <code><RES_Z></code> bytes correspond to the (single precision) floating point values of the implicit function. </dd><dt>[--degree <B-spline degree>] </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). The default value for this parameter is 2. </dd><dt>[--depth <reconstruction depth>] </dt><dd> This integer is the maximum depth of the tree that will be used for surface reconstruction. Running at depth d corresponds to solving on a grid whose resolution is no larger than 2^d x 2^d x ... Note that since the reconstructor adapts the octree to the sampling density, the specified reconstruction depth is only an upper bound. The default value for this parameter is 8. </dd><dt>[--width <finest cell width>] </dt><dd> This floating point value specifies the target width of the finest level octree cells. This parameter is ignored if the --depth flag is also specified. </dd><dt>[--scale <scale factor>] </dt><dd> This floating point value specifies the ratio between the diameter of the cube used for reconstruction and the diameter of the samples' bounding cube. The default value is 1.1. </dd><dt>[--samplesPerNode <minimum number of samples>] </dt><dd> This floating point value specifies the minimum number of sample points that should fall within an octree node as the octree construction is adapted to sampling density. For noise-free samples, small values in the range [1.0 - 5.0] can be used. For more noisy samples, larger values in the range [15.0 - 20.0] may be needed to provide a smoother, noise-reduced, reconstruction. The default value is 1.0. </dd><dt>[--valueWeight <zero-crossing interpolation weight>] </dt><dd> This floating point value specifies the importance that interpolation of the point samples is given in the formulation of the screened Smoothed Signed Distance Reconstruction. The default value for this parameter is 1. </dd><dt>[--gradientWeight <normal interpolation weight>] </dt><dd> This floating point value specifies the importance that interpolation of the points' normals is given in the formulation of the screened Smoothed Signed Distance Reconstruction. The default value for this parameter is 1. </dd><dt>[--biLapWeight <bi-Laplacian weight weight>] </dt><dd> This floating point value specifies the importance that the bi-Laplacian regularization is given in the formulation of the screened Smoothed Signed Distance Reconstruction. The default value for this parameter is 1. </dd><dt>[--iters <GS iters>] </dt><dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the hiearchy. The default value for this parameter is 8. </dd><dt>[--density] </dt><dd> Enabling this flag tells the reconstructor to output the estimated depth values of the iso-surface vertices. </dd><dt>[--colors] </dt><dd> If the input points are in ASCII/binary format and contain color values, this flag lets the reconstruction code know that (1) each sample is represented by nine floating point values instead of the expected six, and that (2) color values should be output with the vertices of the reconstructed surface. (For input samples in the .ply format, the presence of color information, as well as any other additional per-sample data, is automatically determined from the file header.) </dd><dt>[--data <pull factor>] </dt><dd> If the input points have additional data (e.g. color) that is to be sampled at the output vertices, this floating point value specifies the relative importance of finer data over lower data in performing the extrapolation. The default value for this parameter is 32. </dd><dt>[--confidence <normal confidence exponent>] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to adjust its weight. (A point's confidence is defined by the magnitude of its normal.) The default value for this parameter is 0. </dd><dt>[--confidenceBias <normal confidence bias exponent>] </dt><dd> This floating point value specifies the exponent to be applied to a point's confidence to bias the resolution at which the sample contributes to the linear system. (Points with lower confidence are biased to contribute at coarser resolutions.) The default value for this parameter is 0. </dd><dt>[--primalGrid] </dt><dd> Enabling this flag when outputing to a grid file has the reconstructor sample the implicit function at the corners of the grid, rather than the centers of the cells. </dd><dt>[--nonLinearFit] </dt><dd> Enabling this flag has the reconstructor use quadratic interpolation to estimate the positions of iso-vertices. </dd><dt>[--polygonMesh] </dt><dd> Enabling this flag tells the reconstructor to output a polygon mesh (rather than triangulating the results of Marching Cubes). </dd><dt>[--tempDir <temporary output directory>] </dt><dd> This string is the name of the directory to which temporary files will be written. </dd><dt>[--threads <number of processing threads>] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd><dt>[--maxMemory <maximum memory usage (in GB)>] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the reconstruction code (forcing the execution to terminate if the limit is exceeded). </dd><dt>[--performance] </dt><dd> Enabling this flag provides running time and peak memory usage at the end of the execution. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the surface reconstructor. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PointInterpolant: Fits a function to a set of sample values and/or gradients by finding the coefficients of the function that minimize an energy composed of a point-wise interpolation term and Laplacian and bi-Laplacian smoothness terms </SUMMARY> <dt>--inValues <input sample positions and values></dt> <dd> This string is the name of the file from which the positions and values will be read. The file should be an ascii file with groups of Dim+1, white space delimited, numbers: the coordinates of the point's position, followed by the value at that point. No information about the number of samples should be specified.</dd> <dt>--inGradients <input sample positions and gradients></dt> <dd> This string is the name of the file from which the positions and gradients will be read. The file should be an ascii file with groups of 2*Dim, white space delimited, numbers: the coordinates of the point's position, followed by the gradient at that point). No information about the number of samples should be specified.</dd> <dt>[--dim <dimension of the samples>]</dt> <dd> This integerl value is the dimension of the samples. The default value is 2. </dd> <dt>[--tree <output octree and coefficients>]</dt> <dd> This string is the name of the file to which the the octree and function coefficients are to be written.</dd> <dt>[--grid <output grid>]</dt> </dt><dd> This string is the name of the file to which the sampled implicit function will be written. The file consistes of seven header lines in ASCII describing the contents, following by the grid values in binary. <UL> <LI>The header looks like:<PRE><CODE>G3 1 FLOAT <RES_X> <RES_Y> <RES_Z> <M_00> <M_01> <M_02> <M_03> <M_10> <M_11> <M_12> <M_13> <M_20> <M_21> <M_22> <M_23> <M_30> <M_31> <M_22> <M_33> </CODE></PRE> The first two lines describe the contents of the file -- a 3D grid with a single floating point value per cell. The next line gives the resolution of the grid in <code>x</code>-, <code>y</code>-, and <code>z</code>-directions. The following four lines give the 4x4 coefficients of the homogenous transformation <CODE><M></CODE> taking grid-space coordinates to world-coordinates. <LI> The next 4 x <code><RES_X></code> x <code><RES_Y></code> x <code><RES_Z></code> bytes correspond to the (single precision) floating point values of the implicit function. <dt>[--degree <B-spline degree>]</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). The default value for this parameter is 2.</dt> <dt>[--bType <boundary type>]</dt> <dd> This integer specifies the boundary type for the finite elements. Valid values are: <ul> <li> 1: Free boundary constraints</li> <li> 2: Dirichlet boundary constraints</li> <li> 3: Neumann boundary constraints</li> </ul> The default value for this parameter is 1 (free). <dt>[--depth <reconstruction depth>]</dt> <dd> This integer is the maximum depth of the tree that will be used for surface reconstruction. Running at depth d corresponds to solving on a grid whose resolution is no larger than 2^d x 2^d x ... Note that since the reconstructor adapts the octree to the sampling density, the specified reconstruction depth is only an upper bound. The default value for this parameter is 8.</dd> <dt>[--width <finest cell width>]</dt> <dd> This floating point value specifies the target width of the finest level octree cells. This parameter is ignored if the --depth is also specified.</dd> <dt>[--scale <scale factor>]</dt> <dd> This floating point value specifies the ratio between the diameter of the cube used for reconstruction and the diameter of the samples' bounding cube. The default value is 1.1.</dd> <dt>[--valueWeight <value interpolation weight>]</dt> <dd> This floating point value specifies the importance that interpolation of the samples' values is given in the fitting of the function. The default value for this parameter is 1000.</dd> <dt>[--gradientWeight <gradient interpolation weight>]</dt> <dd> This floating point value specifies the importance that interpolation of the samples' gradients is given in the fitting of the function. The default value for this parameter is 1. This value is ignored unless gradient interpolation is specified.</dd> <dt>[--lapWeight <Laplacian weight>]</dt> <dd> This floating point value specifies the importance that Laplacian regularization is given in the fitting of the function. The default value for this parameter is 0.</dd> <dt>[--biLapWeight <bi-Laplacian weight>]</dt> <dd> This floating point value specifies the importance that bi-Laplacian regularization is given in the fitting of the function. The default value for this parameter is 1.</dd> <dt>[--iters <GS iters>]</dt> <dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the hiearchy. The default value for this parameter is 8.</dd> <dt>[--performance]</dt> <dd> Enabling this flag provides running time and peak memory usage at the end of the execution.</dd> <dt>[--verbose]</dt> <dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the surface reconstructor.</dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> SurfaceTrimmer: Trims off parts of a triangle mesh with a per-vertex signal whose value falls below a threshold (used for removing parts of a reconstructed surface that are generated in low-sampling-density regions) </SUMMARY> <dt>--in <input triangle mesh> </dt><dd> This string is the name of the file from which the triangle mesh will be read. The file is read in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format and it is assumed that the vertices have a value field which stores the signal's value. (When run with --density flag, the reconstructor will output this field with the mesh vertices.) </dd><dt>--trim <trimming value> </dt><dd> This floating point values specifies the value for mesh trimming. The subset of the mesh with signal value less than the trim value is discarded. </dd><dt>[--out <output triangle mesh>] </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="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--aRatio <island area ratio>] </dt><dd> This floating point value specifies the area ratio that defines a disconnected component as an "island". Connected components whose area, relative to the total area of the mesh, are smaller than this value will be merged into the output surface to close small holes. The default value 0.001. </dd><dt>[--polygonMesh] </dt><dd> Enabling this flag tells the trimmer to output a polygon mesh (rather than triangulating the trimming results). </dd><dt>[--removeIslands] </dt><dd> Enabling this flag tells the trimmer to discard small disconnected components of surface. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the surface reconstructor. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> ImageStitching: Stitches together a composite of image tiles into a seamless panorama by solving for the correction term (solving a 2D Laplacian system) <a href="https://www.agarwala.org/efficient_gdc/">[Agarwala, 2007]</A> </SUMMARY> <dt>--in <input composite image> <input label image> </dt><dd> This pair of strings give the name of the composite image file and the associated label file. All pixels in the composite that come from the same source should be assigned the same color in the label file. PNG and JPG files are supported (though only PNG should be used for the label file as it is lossless). </dd><dt>[--out <output image>] </dt><dd> This string is the name of the file to which the stitched image will be written. PNG and JPG files are supported. </dd><dt>[--degree <B-spline degree>] </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). The default value for this parameter is 1. </dd><dt>[--wScl <successive under-relaxation scale>] </dt><dd> This floating point value specifies the scale for the adapted successive under-relaxation used to remove ringing. The default value 0.125. </dd><dt>[--wExp <successive under-relaxation exponent>] </dt><dd> This floating point value specifies the exponent for the adapted successive under-relaxation used to remove ringing. The default value 6. </dd><dt>[--iters <GS iters>] </dt><dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the hiearchy. The default value for this parameter is 8. </dd><dt>[--threads <number of processing threads>] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd><dt>[--maxMemory <maximum memory usage (in GB)>] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the code (forcing the execution to terminate if the limit is exceeded). </dd><dt>[--performance] </dt><dd> Enabling this flag provides running time and peak memory usage at the end of the execution. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the image stitcher. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> EDTInHeat: Computes the unsigned Euclidean Distance Transform of a triangle mesh (solving two 3D Laplacian systems) <A HREF="https://www.cs.cmu.edu/~kmcrane/Projects/HeatMethod/">[Crane, Weischedel, and Wardetzky, 2013]</A> </SUMMARY> <dt>--in <input mesh> </dt><dd> This string is the name of the file from which the triangle mesh will be read. The file is assumed to be in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--out <output octree and coefficients>] </dt><dd> This string is the name of the file to which the the octree and solution coefficients are to be written. </dd><dt>[--degree <B-spline degree>] </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). The default value for this parameter is 1. </dd><dt>[--depth <edt depth>] </dt><dd> This integer is the maximum depth of the tree that will be used for computing the Euclidean Distance Transform. Running at depth d corresponds to solving on a grid whose resolution is no larger than 2^d x 2^d x ... The default value for this parameter is 8. </dd><dt>[--scale <scale factor>] </dt><dd> This floating point value specifies the ratio between the diameter of the cube used for computing the EDT and the diameter of the mesh's bounding cube. The default value is 2. </dd><dt>[--diffusion <diffusion time>] </dt><dd> This floating point value specifies the time-scale for the initial heat diffusion. The default value is 0.0005. </dd><dt>[--valueWeight <zero-crossing interpolation weight>] </dt><dd> This floating point value specifies the importance that the EDT evaluate to zero at points on the input mesh is given. The default value for this parameter is 0.01. </dd><dt>[--wScl <successive under-relaxation scale>] </dt><dd> This floating point value specifies the scale for the adapted successive under-relaxation used to remove ringing. The default value 0.125. </dd><dt>[--wExp <successive under-relaxation exponent>] </dt><dd> This floating point value specifies the exponent for the adapted successive under-relaxation used to remove ringing. The default value 6. </dd><dt>[--iters <GS iters>] </dt><dd> This integer value specifies the number of Gauss-Seidel relaxations to be performed at each level of the hiearchy. The default value for this parameter is 8. </dd><dt>[--threads <number of processing threads>] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd><dt>[--maxMemory <maximum memory usage (in GB)>] </dt><dd> If positive, this integer value specifies the peak memory utilization for running the code (forcing the execution to terminate if the limit is exceeded). </dd><dt>[--performance] </dt><dd> Enabling this flag provides running time and peak memory usage at the end of the execution. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the EDT computation. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> AdaptiveTreeVisualization: Extracts iso-surfaces and a sampling on a regular grid from an implicit function represented over an adapted tree </SUMMARY> <dt>--in <input tree and coefficients> </dt><dd> This string is the name of the file from which the tree and implicit functions coefficients are to be read.</dd> <dt>[--samples <input sample positions>]</dt> <dd> This string is the name of the file from which sampling positions are to be read. The file should be an ascii file with groups of Dim white space delimited, numbers giving the coordinates of the sampling points' position. No information about the number of samples should be specified.</dd> </dd> <dt>[--grid <output value grid>] </dt><dd> This string is the name of the file to which the sampled implicit function will be written. The file consistes of seven header lines in ASCII describing the contents, following by the grid values in binary. <UL> <LI>The header looks like:<PRE><CODE>G3 1 FLOAT <RES_X> <RES_Y> <RES_Z> <M_00> <M_01> <M_02> <M_03> <M_10> <M_11> <M_12> <M_13> <M_20> <M_21> <M_22> <M_23> <M_30> <M_31> <M_22> <M_33> </CODE></PRE> The first two lines describe the contents of the file -- a 3D grid with a single floating point value per cell. The next line gives the resolution of the grid in <code>x</code>-, <code>y</code>-, and <code>z</code>-directions. The following four lines give the 4x4 coefficients of the homogenous transformation <CODE><M></CODE> taking grid-space coordinates to world-coordinates. <LI> The next 4 x <code><RES_X></code> x <code><RES_Y></code> x <code><RES_Z></code> bytes correspond to the (single precision) floating point values of the implicit function. </dd><dt>[--primalGrid] </dt><dd> Enabling this flag when outputing a grid file samples the implicit function at the corners of the grid, rather than the centers of the cells. </dd><dt>[--mesh <output triangle mesh>] </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="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. This is only supported for dimension 3. </dd><dt>[--iso <iso-value for mesh extraction>] </dt><dd> This floating point value specifies the iso-value at which the implicit surface is to be extracted. The default value is 0. </dd><dt>[--nonLinearFit] </dt><dd> Enabling this flag has the reconstructor use quadratic interpolation to estimate the positions of iso-vertices. </dd><dt>[--polygonMesh] </dt><dd> Enabling this flag tells the reconstructor to output a polygon mesh (rather than triangulating the results of Marching Cubes). </dd><dt>[--flip] </dt><dd> Enabling this flag flips the orientations of the output triangles. </dd><dt>[--threads <number of processing threads>] </dt><dd> This integer specifies the number of threads across which the algorithm should be parallelized. The default value for this parameter is equal to the numer of (virtual) processors on the executing machine. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the visualizer. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> ChunkPly: Decomposes a collection of mesh/point-set files into a set of chunks with prescribed bounding box widths. </SUMMARY> <dt>--in <input geometry file count, geometry file #1, geometry file #2, ...> </dt><dd> These white-space separated strings give the number of geometry files (containing representing either a point cloud in 3D or a mesh) and the names of the individual files. </dd><dt>[--out <output ply file name/header>] </dt><dd> This string is the name of the file/header to which the chunks should be written. If the width of the chunk is W, the file containing the geometry inside the cube [W·i,W·(i+1)]×[W·j,W·(j+1)]×[W·k,W·(k+1)] will be named <output header>.i.j.k.ply. </dd><dt>[--width <chunk width>] </dt><dd> This floating point value specifies the width of the cubes used for chunking. The default value for this parameter is -1, indicating that the input should be written to a single ouput. (In this case the value of the --out parameter is the name of the single file to which the output is written. </dd><dt>[--radius <padding radius>] </dt><dd> This floating point value specifies the size of the padding region used, as a fraction of the total width of the cube. The default value for this parameter is 0, indicating that no padding should be used. </dd><dt>[--noNormals] </dt><dd> Enabling this flag lets the chunking code know that, in the case that the input is a point cloud in raw ASCII/binary format, the points do not have normals associated with them.. </dd><dt>[--colors] </dt><dd> Enabling this flag lets the chunking code know that, in the case that the input is a point cloud in raw ASCII/binary format, the points have color associatd with them. </dd><dt>[--values] </dt><dd> Enabling this flag lets the chunking code know that, in the case that the input is a point cloud in raw ASCII/binary format, the points have scalar values associated with them. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a more verbose description of the running times and memory usages of individual components of the visualizer. </dd> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PointsToDisks: Converts oriented points to disks. </SUMMARY> <dt>--in <input points> </dt><dd> This string is the name of the file from which the point set will be read. The file is assumed to be in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--out <output ply file name>] </dt><dd> This string is the name of the file to which the disks should be written. The file will be written out in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format. </dd><dt>[--scale <radius scale>] </dt><dd> This floating point value specifies the radius of the disks, relative to the width of the bounding cube. The default value for this parameter is 0.005 </dd><dt>[--res <angular resolution>] </dt><dd> This integer v value specifies thangular resolution of the disk. The default value for this parameter is 12. </dd><dt>[--keep <number of points to keep>] </dt><dd> This integer value specifies the maximum number of point to transform to disks. If the value of this parameter is less than the number of points, the subset of points transformed to disks will be generated by regular sub-sampling. If the value of this parameter is not set and the --fraction parameter is not set, then all points will be transformed to disks. </dd><dt>[--fraction <faction of points to keep>] </dt><dd> This floating point value specifies the fraction of points to transform to disks. The default value for this parameter is 1.0. If both the --keep flag and the --fraction flag are set, the --fraction flag will be ignored. </dd><dt>[--verbose] </dt><dd> Enabling this flag provides a description of running state. </dd> </DETAILS> </dl> </ul> <hr> <a name="LIBRARY">HEADER-ONLY LIBRARY</a> <UL> <DL> <DETAILS> <SUMMARY> Reconstruction.example.cpp </SUMMARY> In addition to executables, the reconstruction code can be interfaced into through the functionality implemented in <CODE>Reconstructors.h</CODE> and <CODE>Extrapolator.h</CODE> Using the functionality requires requires choosing a finite element type and defining input oriented-point stream and output vertex and face streams. In the descriptions below, the template parameter <CODE>Real</CODE> is the floating point type used to represent data (typically <code>float</code>) and <CODE>Dim</CODE> is the integer dimension of the space (fixed at <CODE>Dim</CODE>=3). <UL> <LI>The template parameter <CODE>FEMSig</CODE> describes the 1D finite element type, which is a composite of the degree of the finite element and the boundary conditions it satisfies. Given an integer valued <CODE>Degree</CODE> and boundary type <CODE>BType</CODE> (one of <CODE>BOUNDARY_FREE</CODE>, <CODE>BOUNDARY_DIRICHLET</CODE>, and <CODE>BOUNDARY_NEUMANN</CODE> defined in <CODE>BSplineData.h</CODE>), the signature is defined as: <PRE> <CODE>static const unsigned int FEMSig = FEMDegreeAndBType< Degree , BoundaryType >::Signature;</CODE> </PRE> <LI>The template parameter <CODE>FEMSIgs</CODE> describes the tensor-product finite element type, typically defined as an "isotropic" element with the same 1D finite element type across all <CODE>Dim</CODE> dimensions. It is defined as: <PRE> <CODE>using FEMSigs = IsotropicUIntPack< Dim , FEMSig >;</CODE> </PRE> </UL> The three streams are defined by overriding virtual stream classes. The namespace <CODE>PoissonRecon::Reconstructor</CODE> is omitted for brevity. <UL> <LI>Input sample stream: This class derives from the <CODE>InputSampleStream< Real , Dim ></CODE> class. The base class has two pure virtual methods that need to be over-ridden: <UL> <LI><CODE>void reset( void )</CODE>: This method resets the stream to the start (necessary because the reconstruction code performs two passes over the input samples). <LI><CODE>bool read( Point< Real , Dim > &p , Point< Real , Dim > &n )</CODE>: This method tries to read the next pair of positions/normals from the stream, returning <code>true</code> if the read was successful and <code>false</code> if the read failed (i.e. the end of the stream was reached). The class <code>Point< Real , Dim ></code> represents a point in <code>Dim</code>-dimensional space, can be accessed like an array (i.e. overloads the bracked operator) and supports algebraic manipulation like addition and scalar multiplication. </UL> <LI>Output polygon stream: This class derives from the <CODE>OutputPolygonStream</CODE> class. The base class has two pure virtual methods that needs to be over-ridden: <UL> <LI><CODE>size_t size( void )</CODE>: This method returns the number of polygons written. <LI><CODE>size_t write( const std::vector< node_index_type > &polygon )</CODE>: This method writes the information for the next polygon into the stream, with the polygon represented as a <code>std::vector</code> of integral indices. (The type <code>node_index_type</code> is an <code>unsigned int</code> if the <CODE>BIG_DATA</CODE> macro is not defined an <code>unsigned long long</code> if it is.) The function returns the index of the written polygon. </UL> <LI>Output vertex stream: This class derives from the <CODE>OutputVertexStream< Real , Dim ></CODE> class. The base class has two pure virtual methods that needs to be over-ridden: <UL> <LI><CODE>size_t size( void )</CODE>: This method returns the number of vertices written. <LI><CODE>size_t write( Point< Real , Dim > p , Point< Real , Dim > g , Real w )</CODE>: This method writes the information for the next vertx into the stream. The data includes the position of the vertex, <CODE>p</CODE>, as well as the gradient, <code>g</code>, and density weight, <code>w</code> if the extraction code is asked to compute those. The function returns the index of the written vertex. </UL> </UL> The reconstructed surface is then computed in two steps. First, an <CODE>Implict< Real , Dim , FEMSigs ></CODE> object is created, encoding the implicit function describing the geometry, as well as a density function describing the distribution of points in space and (possibly) a function extrapolating per-sample information into a volumetric function. Then, the implicit function is iso-surfaced, (possibly) with auxialiary density and color information evaluated at the vertex positions. <UL> <LI><CODE>Implict< Real , Dim , FEMSigs > *Poisson::Solver< Real , Dim , FEMSigs >::Solve( InputOrientedSampleStream< Real , Dim > &pointStream , SolutionParameters< Real &gt params )</CODE>: This function takes in an input oriented sample stream (<code>pointStream</code>) and a description of the reconstruction parameters (<code>params</code>) desribing the depth, number of samples per node, etc., and returns a pointer to the (dynamically allocated) implicit represetation (<code>Reconstructors.h</code>, line 622). <LI><CODE>void Implicit< Real , Dim , FEMSigs &gt::extractLevelSet( OutputVertexStream< Real , Dim > &vStream , OutputFaceStream< Dim-1 > &pStream , LevelSetExtractionParameters meParams )</CODE>: This member function takes references to the output vertex (<code>vStream</code>) and polygon (<code>pStream</code>) streams and parameters for level-set extraction (<code>meParams</code>) and computes the extracted mesh, writing its vertices and faces into the corresponding output streams as they are generated (<code>Reconstructors.h</code>, line 548). </UL> In Addition, the code supports evaluation of the implicit function at points within the bounding cube: <UL> <LI><CODE>Implicit< Real , Dim , FEMSigs >::evaluator( void )</CODE>: This member function returns an object of type <CODE>Implicit< Real , Dim , FEMSigs >::Evaluator</CODE>. (Note that as the <CODE>Implicit< Real , Dim , FEMSigs >::Evaluator</CODE> object stores <CODE>const</CODE> references to the state in the <CODE>Implicit< Real , Dim , FEMSigs ></CODE> object, it will not be valid once the defining <CODE>Implicit< Real , Dim , FEMSigs ></CODE> object goes out of scope.) <LI><CODE>Real Implicit< Real , Dim , FEMSigs >::Evaluator::operator()( Point< Real , Dim > )</CODE>: This member function returns the value of the implicit function at the prescribed point. The point is assumed to be given in world coordinates, and a <CODE>Implicit< Real , Dim , FEMSigs >::Evaluator::OutOfUnitCubeException</CODE> is thrown if it is outside of the unit-cube containing the input samples. <LI><CODE>Point< Real , Dim > Implicit< Real , Dim , FEMSigs >::Evaluator::grad( Point< Real , Dim > )</CODE>: This member function returns the gradient of the implicit function at the prescribed point. The point is assumed to be given in world coordinates, and a <CODE>Implicit< Real , Dim , FEMSigs >::Evaluator::OutOfUnitCubeException</CODE> is thrown if it is outside of the unit-cube containing the input samples. </UL> And, for samples with auxiliary data, the code supports construction of an extrapolating auxiliary data field that can be queried within the bounding cube: <UL> <LI><CODE>Extrapolator::Implicit< Real , Dim , AuxData , DataDegree >::Implicit( InputStream< Real , Dim , AuxData > &pointStream , Parameters params , AuxData zeroAuxData )</CODE>: This constructor creates an extrapolating field from the samples with auxiliary data, using the prescribed parameters. The final parameter, <code>zeroAuxData</code> is an object representing the zero-element of the auxiliary data. <LI><CODE>AuxData Extrapolator::Implicit< Real , Dim , AuxData , DataDegree >::operator()( Point< Real , Dim > p )</CODE>: This method returns the extrapolated value at the prescribed position. </UL> Code walk-through: <UL> These steps can be found in the <code>Reconstruction.example.cpp</code> code. <UL> <LI>The finite-elements signatures are created in lines 322 and 325. <LI>An input sample stream generating a specified number of random points on the surface of the sphere is defined in lines 99-136 and constructed in line 393. <LI>An output polygon stream that pushes the polygon to an <code>std::vector</code> of <code>std::vector< int ></code>s is defined in lines 227-244 and constructed in line 403. <LI>An output vertex stream that pushes just the position information to an <code>std::vector</code> of <code>Real</code>s is desfined in lines 247-258 and constructed in line 404. <LI>The implicit representation is computed in line 396. <LI>The level-set extraction is performed on line 407. <LI>The evaluator is created on line 354. <LI>The evaluator is used to query the values and gradients of the implicit function in line 347. <LI>The extrapolator is constructed on line 425. <LI>The extrapolator is evaluated at the vertex positions at line 435. </UL> Note that a similar approach can be used to perform the <A HREF="http://mesh.brown.edu/ssd/">Smoothed Signed Distance</A> reconstruction (lines 473 and 474). The approach also supports reconstruction of meshes with auxiliary information like color, with the only constraint that the auxiliary data type supports the computation affine combinations (e.g. the <CODE>RGBColor</CODE> type defined in lines 67-82). The auxiliary inform is derived in one of two ways: <OL> <LI> As part of the reconstruction process, so that the level-set extraction phase also sets the auxiliary information. (Lines 363-389) <LI> Independently by constructing the extrapolation field from the samples and then evaluating at the positions of the level-set vertices. (Lines 414-441) </OL> To avoid inefficient locking in a multi-threaded application, the <CODE>Add</CODE> method of the type trait <CODE>PoissonRecon::Atomic<RGBColor></CODE> is specialized (lines 84-96) to define the atomic operation <CODE> a += b</CODE>. </UL> </DL> </UL> <hr> <a name="USAGE">USAGE EXAMPLES (WITH SAMPLE DATA)</a> <ul> <dl> <DETAILS> <SUMMARY> PoissonRecon / SSDRecon / SurfaceTrimmer / ChunkPly </SUMMARY> For testing purposes, four point sets are provided: <ol> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/horse.npts">Horse</a>: A set of 100,000 oriented point samples (represented in ASCII format) was obtained by sampling a virtual horse model with a sampling density proportional to curvature, giving a set of non-uniformly distributed points. The surface of the model can be reconstructed by calling the either Poisson surface reconstructor: <blockquote><code>% PoissonRecon --in horse.npts --out horse.ply --depth 10</code></blockquote> or the SSD surface reconstructor <blockquote><code>% SSDRecon --in horse.npts --out horse.ply --depth 10</code></blockquote> </li> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/bunny.points.ply">Bunny</a>: A set of 362,271 oriented point samples (represented in PLY format) was obtained by merging the data from the original Stanford Bunny <a href="ftp://graphics.stanford.edu/pub/3Dscanrep/bunny.tar.gz">range scans</a>. The orientation of the sample points was estimated using the connectivity information within individual range scans. The original (unscreened) Poisson reconstruction can be obtained by setting the point interpolation weight to zero: <blockquote><code>% PoissonRecon --in bunny.points.ply --out bunny.ply --depth 10 --pointWeight 0</code></blockquote> By default, the Poisson surface reconstructor uses degree-2 B-splines. A more efficient reconstruction can be obtained using degree-1 B-splines: <blockquote><code>% PoissonRecon --in bunny.points.ply --out bunny.ply --depth 10 --pointWeight 0 --degree 1</code></blockquote> (The SSD reconstructor requires B-splines of degree at least 2 since second derivatives are required to formulate the bi-Laplacian energy.) </li> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/eagle.points.ply">Eagle</a>: A set of 796,825 oriented point samples with color (represented in PLY format) was obtained in the EPFL <a href="https://lgg.epfl.ch/statues.php">Scanning 3D Statues from Photos</a> course. A reconstruction of the eagle can be obtained by calling: <blockquote><code>% PoissonRecon --in eagle.points.ply --out eagle.pr.ply --depth 10</code></blockquote> (with the RGBA color properties automatically detected from the .ply header). A reconstruction of the eagle that does not close up the holes can be obtained by first calling: <blockquote><code>% SSDRecon --in eagle.points.ply --out eagle.ssd.ply --depth 10 --density</code></blockquote> using the --density flag to indicate that density estimates should be output with the vertices of the mesh, and then calling: <blockquote><code>% SurfaceTrimmer --in eagle.ssd.ply --out eagle.ssd.trimmed.ply --trim 7</code></blockquote> to remove all subsets of the surface where the sampling density corresponds to a depth smaller than 7. This reconstruction can be chunked into cubes of size 4×4×4 by calling: <blockquote><code>% ChunkPly --in 1 eagle.ssd.trimmed.ply --out eagle.ssd.trimmed.chnks --width 4</code></blockquote> which partitions the reconstruction into 11 pieces. <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/torso.zip">Torso</a>: A set of 3,488,432 (torso.points.ply) and an envelope (torso.envelope.ply). A reconstruction of the torso that constrains the reconstruction to be contained within the envelope can be obtained by calling: <blockquote><code>% PoissonRecon --in torso.points.ply --envelope torso.envelope.ply --out torso.pr.ply --depth 10</code></blockquote> using the --envelope flag to specify the water-tight mesh constraining the reconstruction. </li> </ol> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PoissonReconServer / PoissonReconClient </SUMMARY> For testing purposes, two point sets are provided: <ol> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/eagle.points.ply">Eagle</a>: A set of 796,825 oriented point samples with color was obtained in the EPFL <a href="https://lgg.epfl.ch/statues.php">Scanning 3D Statues from Photos</a> course. Assuming the point-set is placed in the networked file <code><in dir></CODE> and that a networked temporary folder <code><temp dir></code> exists, a distributed reconstruction of the eagle over 4 clients at depth 10, outputting the reconstruction to <code>eagle.ply</code> (relative to the directory from the server is run), can be obtained by calling: <blockquote><code>% PoissonReconServer --count 4 --depth 10 --in <in dir>/eagle.points.ply --tempDir <temp dir>/temp --out eagle.ply </code></blockquote> (with the RGBA color properties automatically detected from the .ply header). This will initiate the server which will output the address and port for the clients to connect to: <blockquote><code>Server Address: <IPv4 address>:<port></code></blockquote> The four clients can then be executed by connecting them to the server: <blockquote><code>% PoissonReconClient --port <port> --address <IPv4 address></code></blockquote> <blockquote><code>% PoissonReconClient --port <port> --address <IPv4 address></code></blockquote> <blockquote><code>% PoissonReconClient --port <port> --address <IPv4 address></code></blockquote> <blockquote><code>% PoissonReconClient --port <port> --address <IPv4 address></code></blockquote> Alternatively, the four clients can be executed serially: <blockquote><code>% PoissonReconClient --port <port> --address <IPv4 address> --multi 4</code></blockquote> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/SafraSquare.points.ply">Safra Square</a>: For testing purposes, the <A HREF="10163.points.ply">Safra-Square</A> point set, containing 2,364,268,059 oriented point samples with color, has been generously provided by <A HREF="https://www.resonai.com/">Resonai</A>. </li> </ol> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> PointInterpolant / AdaptiveTreeVisualization </SUMMARY> For testing purposes, a pair of point-sets is provided: <ol> <li> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/quadratic.2D.fitting.samples">fitting samples</a>: A set of 1000 random 2D samples from within the square [-1,1,]x[-1,1] along with the evaluation of the quadratic f(x,y)=x*x+y*y at each sample point (represented in ASCII format). <LI> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/quadratic.2D.evaluation.samples">evaluation samples</a>: A set of 4 2D positions at which the fit function is to be evaluated (represented in ASCII format). </ol>

The function fitting the input samples can be by calling the point interpolant:

<blockquote><code>% PointInterpolant --inValues quadratic.2D.fitting.samples --tree quadratic.2D.tree --dim 2</code></blockquote> Then, the reconstructed function can be evaluated at the evaluation samples by calling the adaptive tree visualization: <blockquote><code>% AdaptiveTreeVisualization --in quadratic.2D.tree --samples quadratic.2D.evaluation.samples</code></blockquote> This will output the evaluation positions and values: <blockquote><CODE>0 0 1.33836e-05</CODE></blockquote> <blockquote><CODE>0.5 0 0.25001</CODE></blockquote> <blockquote><CODE>0.5 0.5 0.500006</CODE></blockquote> <blockquote><CODE>2 2 nan</CODE></blockquote> Note that because the (last) evaluation position (2,2) is outside the bounding box of the fitting samples, the function cannot be evaluated at this point and a value of "nan" is output. </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> ImageStitching </SUMMARY> For testing purposes, two panoramas are provided: <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Jaffa.zip">Jaffa</a> (23794 x 9492 pixels) and <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/OldRag.zip">OldRag</a> (87722 x 12501 pixels).

A seamless panorama can be obtained by running:

<blockquote><code>% ImageSitching --in pixels.png labels.png --out out.png</code></blockquote> </DETAILS> </dl> </ul> <ul> <dl> <DETAILS> <SUMMARY> EDTInHeat / AdaptiveTreeVisualization </SUMMARY> The Euclidean Distance Tranform of the reconstructed horse can be obtained by running: <blockquote><code>% EDTInHeat --in horse.ply --out horse.edt --depth 9</code></blockquote> Then, the visualization code can be used to extract iso-surfaces from the implicit function. To obtain a visualization near the input surface, use an iso-value close to zero: <blockquote><code>% AdaptiveTreeVisualization.exe --in horse.edt --mesh horse_0.01_.ply --iso 0.01 --flip</code></blockquote> (By default, the surface is aligned so that the outward facing normal aligns with the negative gradient. Hence, specifying the <CODE>--flip</CODE> flag is used to re-orient the surface.) To obtain a visualization closer to the boundary of the bounding box, use an iso-value close to zero: <blockquote><code>% AdaptiveTreeVisualization.exe --in horse.edt --mesh horse_0.25_.ply --iso 0.25 --flip</code></blockquote> (Since the default <CODE>--scale</CODE> is 2, a value of 0.25 should still give a surface that is contained within the bounding box.) To obtain a sampling of the implicit function over a regular grid: <blockquote><code>% AdaptiveTreeVisualization.exe --in horse.edt --grid horse.grid</code></blockquote> </DETAILS> </dl> </ul> <hr> <DETAILS> <SUMMARY> <A NAME="CHANGES">HISTORY OF CHANGES</A> </SUMMARY> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version3/">Version 3</a>: <ol> <li> The implementation of the --samplesPerNode parameter has been modified so that a value of "1" more closely corresponds to a distribution with one sample per leaf node. </li><li> The code has been modified to support compilation under MSVC 2010 and the associated solution and project files are now provided. (Due to a bug in the Visual Studios compiler, this required modifying the implementation of some of the bit-shifting operators.) </li></ol> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4/">Version 4</a>: <ol> <li> The code supports screened reconstruction, with interpolation weight specified through the --pointWeight parameter. </li><li> The code has been implemented to support parallel processing, with the number of threads used for parallelization specified by the --threads parameter. </li><li> The input point set can now also be in <a href="https://www.cc.gatech.edu/projects/large_models/ply.html">PLY</a> format, and the file-type is determined by the extension, so that the --binary flag is now obsolete. </li><li> At depths coarser than the one specified by the value --minDepth the octree is no longer adaptive but rather complete, simplifying the prolongation operator. </li></ol> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.5/">Version 4.5</a>: <ol> <li> The algorithmic complexity of the solver was reduced from log-linear to linear. </li></ol> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version4.5/">Version 4.51</a>: <ol> <li> Smart pointers were added to ensure that memory accesses were in bounds. </li></ol> <a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5/">Version 5</a>: <ol> <li> The --density flag was added to the reconstructor to output the estimated depth of the iso-vertices. </li><li> The SurfaceTrimmer executable was added to support trimming off the subset of the reconstructed surface that are far away from the input samples, thereby allowing for the generation of non-water-tight surface. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.1/">Version 5.1</a>:

<ol> <li> Minor bug-fix to address incorrect neighborhood estimation in the octree finalization. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.5a/">Version 5.5a</a>:

<ol> <li> Modified to support depths greater than 14. (Should work up to 18 or 19 now.) </li><li> Improved speed and memory performance by removing the construction of integral and value tables. </li><li> Fixed a bug in Version 5.5 that used memory and took more time without doing anything useful. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.6/">Version 5.6</a>:

<ol> <li> Added the --normalWeight flag to support setting a point's interpolation weight in proportion to the magnitude of its normal. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.7/">Version 5.7</a>:

<ol> <li> Modified the setting of the constraints, replacing the map/reduce implementation with OpenMP atomics to reduce memory usage. </li><li> Fixed bugs that caused numerical overflow when processing large point clouds on multi-core machines. </li><li> Improved efficiency of the iso-surface extraction phse. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version5.71/">Version 5.71</a>:

<ol> <li> Added the function GetSolutionValue to support the evaluation of the implicit function at a specific point. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6/">Version 6</a>:

<ol> <li> Modified the solver to use Gauss-Seidel relaxation instead of conjugate-gradients at finer resolution. </li><li> Re-ordered the implementation of the solver so that only a windowed subset of the matrix is in memory at any time, thereby reducing the memory usage during the solver phase. </li><li> Separated the storage of the data associated with the octree nodes from the topology. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.1/">Version 6.1</a>:

<ol> <li> Re-ordered the implementation of the iso-surface extraction so that only a windowed subset of the octree is in memory at any time, thereby reducing the memory usage during the extracted phase. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.11/">Version 6.11</a>:

<ol> <li> Fixed a bug that created a crash in the evaluation phase when --pointWeight is set zero. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.12/">Version 6.12</a>:

<ol> <li> Removed the OpenMP firstprivate directive as it seemed to cause trouble under Linux compilations. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13/">Version 6.13</a>:

<ol> <li> Added a MemoryPointStream class in PointStream.inl to support in-memory point clouds. </li><li> Modified the signature of Octree::SetTree in MultiGridOctreeData.h to take in a pointer to an object of type PointStream rather than a file-name. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version6.13a/">Version 6.13a</a>:

<ol> <li> Modified the signature of Octree::SetIsoSurface to rerun a void. [<a href="https://www.danielgm.net/cc/">cloudcompare</a>] </li><li> Added a definition of SetIsoVertexValue supporting double precision vertices. [<a href="https://www.danielgm.net/cc/">cloudcompare</a>] </li><li> Removed Time.[h/cpp] from the repository. [<a href="https://www.danielgm.net/cc/">cloudcompare</a>/<a href="https://asmaloney.com/">asmaloney</a>] </li><li> Fixed assignment bug in Octree::SetSliceIsoVertices. [<a href="https://asmaloney.com/">asmaloney</a>] </li><li> Fixed initialization bug in SortedTreeNodes::SliceTableData and SortedTreeNodes::XSliceTableData. [<a href="https://asmaloney.com/">asmaloney</a>] </li><li> Included stdlib.h in Geometry.h. [<a href="https://asmaloney.com/">asmaloney</a>] </li><li> Fixed default value bug in declaration of Octree::SetTree. [<a href="https://asmaloney.com/">asmaloney</a>] </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version7.0/">Version 7.0</a>:

<ol> <li> Added functionality to support color extrapolation if present in the input. </li><li> Modified a bug with the way in which sample contributions were scaled. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version8.0/">Version 8.0</a>:

<ol> <li> Added support for different degree B-splines. (Note that as the B-spline degree is a template parameter, only degree 1 through 4 are supported. If higher order degrees are desired, additional template parameters can be easily added in the body of the Execute function inside of PoissonRecon.cpp. Similarly, to reduce compilation times, support for specific degrees can be removed.) </li><li> Added the --primalGrid flag to support to extraction of a grid using primal sampling. </li><li> Changed the implementation of the grid sampling so that computation is now linear, rather than log-linear, in the number of samples. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.0/">Version 9.0</a>:

<ol> <li> Added support for free boundary conditions. </li><li> Extended the solver to support more general linear systems. This makes it possible to use the same framework to implement the <a href="http://mesh.brown.edu/ssd/">Smoothed Signed Distance Reconstruction</a> of Calakli and Taubin (2011). </li><li> Modified the implementation of density estimation and input representation. This tends to define a slightly larger system. On its own, this results in slightly increased running-time/footprint for full-res reconstructions, but provides a substantially faster implementation when the output complexity is smaller than the input. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.01/">Version 9.01</a>:

<ol> <li> Reverted the density estimation to behave as in Version 8.0. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version9.01/">Version 9.011</a>:

<ol> <li> Added a parameter for specifying the temporary directory. </li></ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.00/">Version 10.00</a>:

<ol> <li> The code has been reworked to support arbitrary dimensions, finite elements of arbitrary degree, generally SPD systems in the evaluated/integrated values and derivatives of the functions, etc.</LI> <LI> For the reconstruction code, added the --width flag which allows the system to compute the depth of the octree given a target depth for the finest resolution nodes.</LI> <LI> For the reconstruction code, fixed a bug in the handling of the confidence encoded in the lengths of the normals. In addition, added the flags --confidence and --confidenceBias which allow the user more control of how confidence is used to affect the contribution of a sample.</LI> </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.01/">Version 10.01</a>:

<ol> <li> Modified the reconstruction code to facilitate interpolation of other input-sample quantities, in addition to color.</LI> </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.02/">Version 10.02</a>:

<ol> <li> Set the default value for --degree in PoissonRecon to 1 and change the definitiion of DATA_DEGREE to 0 for sharper color interpolation.</LI> </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.03/">Version 10.03</a>:

<ol> <li> Cleaned up memory leaks and fixed a bug causing ImageStitching and EDTInHeat to SEGFAULT on Linux. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.04/">Version 10.04</a>:

<ol> <li> Replaced the ply I/O code with an object-oriented implementation. <LI> Updated the code to support compilation under gcc version 4.8. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.05/">Version 10.05</a>:

<ol> <LI> Added cleaner support for warning and error handling. <LI> Minor bug fixes. <LI> Added a --inCore flag that enables keeping the pointset in memory instead of streaming it in from disk. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.06/">Version 10.06</a>:

<ol> <LI> Improved performance. <LI> Modified <CODE>PoissonRecon</CODE> and <CODE>SSDRecon</CODE> to support processing of 2D point sets. <LI> Modified the 2D implementations of <CODE>PoissonRecon</CODE>, <CODE>SSDRecon</CODE>, and <CODE>AdaptiveTreeVisualization</CODE> to support ouput to <CODE>.jpg</CODE> and <CODE>.png</CODE> image files. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version10.07/">Version 10.07</a>:

<ol> <LI> Removed a bug that would cause memory access errors when some slices were empty. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.00/">Version 11.00</a>:

<ol> <LI> Added support for processing point-sets so large that 32-bit indices for octrees are not sufficient. (Enabled by defining the preprocessor variable BIG_DATA in the file PreProcessor.h. <LI> Added C++11 parallelism for compilers that do not support OpenMP. <LI> Added the code for ChunkPly which breaks up large meshes and/or point-sets into chunks. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.01/">Version 11.01</a>:

<ol> <LI> Fixed bug with _mktemp that caused the code to crash on Windows machine with more than 26 cores. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version11.02/">Version 11.02</a>:

<ol> <LI> Added error handling for numerical imprecision issues arrising when too many samples fall into a leaf node. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version12.00/">Version 12.00</a>:

<ol> <LI> Added functionality enabling AdaptiveTreeVisualization to output the values of a function at prescribed sample positions. <LI> Added the implementation of PointInterpolant that fits a function to a discrete set of sample values. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.00/">Version 13.00</a>:

<ol> <LI> Enabled passing in a constraint envelope to PoissonRecon, allowing one to define a region that is known to be outside the surface. <LI> Updated ChunkPLY to support processing of input points in either ASCII or binary format. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.50/">Version 13.50</a>:

<ol> <LI> Enabled support for automatically detecting attirbutes of input point cloud (in addition to positions and normals) when provided in .ply format. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.60/">Version 13.60</a>:

<ol> <LI> Modified the implementation of PointInterpolant to support separately prescribing value and gradient constraints. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.61/">Version 13.61</a>:

<ol> <LI> Bug fix addressing the problem that the memory for a <CODE>DynamicFactory</CODE> object is dynamically allocated and not only known at construction time. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.70/">Version 13.70</a>:

<ol> <LI> Using the updated <A HREF="https://www.cc.gatech.edu/~turk/ply.tar.gz">PLY libraray</A> with the less restrictive BSD license. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.71/">Version 13.71</a>:

<ol> <LI> Fixed a bug that resulted in incorrect point weighting when the samples were too sparse. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.72/">Version 13.72</a>:

<ol> <LI> Fixed a bug that could result in the reconstruction not solving up to the finest depth when the --width argument is used. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.73/">Version 13.73</a>:

<ol> <LI> Re-fixed a bug that could result in the reconstruction not solving up to the finest depth when the --width argument is used. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.74/">Version 13.74</a>:

<ol> <LI> Fixed a bug that could result in reconstruction failure when the reconstruction depth (e.g. computed using the --width argument) was lower than the full depth value. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.80/">Version 13.80</a>:

<ol> <LI> Updated the SurfaceTrimmer code to better handle small islands. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version13.99/">Version 13.99</a>:

<ol> <LI> Modified the --width parameter so that it serves as an upper bound on the width of a cell at the finest resolution. <LI> Modified the code so that the output mesh no longer has statistics about processing time/memory. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.00/">Version 14.00</a>:

<ol> <LI> Added support for distributed screened Poisson Surface Reconstruction. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.01/">Version 14.01</a>:

<ol> <LI> Added support for fixed width integer types. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.02/">Version 14.02</a>:

<ol> <LI> Fixed overflow bug when there are more than 2^32 nodes in the tree. </ol>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version14.02/">Version 15.00</a>:

<OL> <LI> Added support for header-only interface. <LI> Added example using the header-only interface for reconstructing surfaces from points randomly sampled from a sphere. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.01/">Version 15.01</a>:

<OL> <LI> Cleaned up interface into the reconstruction library. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.02/">Version 15.02</a>:

<OL> <LI> Changed <CODE>Poisson</CODE> and <CODE>SSD</CODE> to be classes for cleaner library interface in <code>Reconstruction.example.cpp</code>. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.03/">Version 15.03</a>:

<OL> <LI> Fixed <code>--width</code> bug in estimating scale factor. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version15.10/">Version 15.10</a>:

<OL> <LI> Added iso-curve extraction support (for 2D reconstruction) </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.01/">Version 16.01</a>:

<OL> <LI> Added support for separte value interpolation in Poisson Surface Reconstruction </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.02/">Version 16.02</a>:

<OL> <LI> Added support for additional .ply types </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.03/">Version 16.03</a>:

<OL> <LI> Fixed <code>--width</code> compatibility bug with default depth. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.04/">Version 16.04</a>:

<OL> <LI> Fixed <code>--exact</code> bug. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.05/">Version 16.05</a>:

<OL> <LI> Fixed <code>ChunkPly</code> bug. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.06/">Version 16.06</a>:

<OL> <LI> Added <code>--keepSeparate</code> flag to <code>PoissonReconServer</code> to output non-fused geometry.. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.07/">Version 16.07</a>:

<OL> <LI> Fixed <code>--width</code> bug. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.08/">Version 16.08</a>:

<OL> <LI> Fixed <code>--kernelDepth</code> bug that occured when the <code>--width</code> flag was used to set the reconstruction depth. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.09/">Version 16.09</a>:

<OL> <LI> Removed dependence on <code>_mktemp</code>. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version16.10/">Version 16.10</a>:

<OL> <LI> Removed dependence on <code>_mktemp</code>. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version17.00/">Version 17.00</a>:

<OL> <LI> Added code for converting oriented points to disks for visualization. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.00/">Version 18.00</a>:

<OL> <LI> Encapsulated the code within the <CODE>PoissonRecon</CODE> namespace. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.01/">Version 18.01</a>:

<OL> <LI> Introduced compiler support for CLANG-sanitized code via the pre-processor flag <CODE>SANITIZED_PR</CODE>. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.02/">Version 18.02</a>:

<OL> <LI> Cleaned up bug in <ocde>PointsToDisks</code> executable. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.03/">Version 18.03</a>:

<OL> <LI> Fixed bug occurring when the octree was complete. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.04/">Version 18.04</a>:

<OL> <LI> Further sanitized multi-threading code. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.05/">Version 18.05</a>:

<OL> <LI> Replaced <BODE>BlockedVector</CODE> with <CODE>NestedVector</CODE> to reduce synchronization. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.10/">Version 18.10</a>:

<OL> <LI> Removed mutual exclusion in the iso-surfacing phase. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.20/">Version 18.20</a>:

<OL> <LI> Added an interface for evaluating the implicit function's values and gradients at points inside the bounding cube. <LI> Added a <CODE>--evaluate</CODE> flag to the <CODE>Reconstruction.example</CODE> executable that evaluates the implicit function at an interior/exterior/boundary point on the sphere. <LI> Changed defaults for PoissonReconstruction to use value interpolation and to evaluate to 0.5 at the input samples. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.30/">Version 18.30</a>:

<OL> <LI> Added an interface for evaluating the implicit data (e.g. color) field extrapolated from the samples. <LI> Modified the <CODE>--color</CODE> flag of the <CODE>Reconstruction.example</CODE> executable to support evaluation of colors from the extrapolated field. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.31/">Version 18.31</a>:

<OL> <LI> Removed the smoothing option in the <CODE>SufaceTrimmer</CODE> executable. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.35/">Version 18.35</a>:

<OL> <LI> Removed the confidence bias option. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.40/">Version 18.40</a>:

<OL> <LI> Added support for extrapolator accumulation. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.41/">Version 18.41</a>:

<OL> <LI> Removed explicitly instantiated static variables. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.42/">Version 18.42</a>:

<OL> <LI> Fixed parallelization bugs in <CODE>Extrapolator</CODE>. <LI> Moified <CODE>Reconstruction.example</CODE> to use parallelized extrapolation. </OL>

<a href="https://www.cs.jhu.edu/~misha/Code/PoissonRecon/Version18.50/">Version 18.50</a>:

<OL> <LI> Cleaned-up multi-threading code. </OL> </DETAILS> <hr> <a name="SUPPORT">SUPPORT</a> <UL> <LI>This work was genersouly supported by the National Science Foundation (NSF) grant numbers <A HREF="https://www.nsf.gov/awardsearch/showAward?AWD_ID=0746039">0746039</A> and <A HREF="https://www.nsf.gov/awardsearch/showAward?AWD_ID=1422325">1422325</A>. <LI>We are extremely grateful to the EPFL <a href="https://lgg.epfl.ch/statues.php">Scanning 3D Statues from Photos</a> course, the <A HREF="http://graphics.stanford.edu/data/3Dscanrep/">Stanford 3D Scanning Repository</A>, and <A HREF="https://www.resonai.com/">Resonai</A> for sharing their data. <LI>This work was carried out at the <A HREF="https://www.arch.jhu.edu/">Advanced Research Computing at Hopkins (ARCH)</A> core facility, which is supported by the National Science Foundation (NSF) grant number <A HREF="https://www.nsf.gov/awardsearch/showAward?AWD_ID=1920103">1920103</A>. </UL>