Wei Zhang authored Jul 10, 2019 and David Flynn committed Aug 12, 2019

This avoids artefacts during trisoup generation by checking whether the
original slice partition interval is an integer multiple of the block
size W=2^(trisoup_node_size_log2). If not, the partition interval is
rounded up to the nearest integer that is exactly divisible by the block
size.

Yiting Shao authored Jun 14, 2019 and David Flynn committed Aug 12, 2019

This commit adds a process to limit the number of points per slice to be
within a hard upper limit and soft lower limit.

Yiting Shao authored Jun 14, 2019 and David Flynn committed Aug 12, 2019

Adjust the operation sequence of slice partition and geometry quantization. We
do geometry quantization first and then do the slice partition, so that the
point number of each slice would be kept in the predefined range under
lossless/lossy geometry coding conditions.

This is part of a series attempting to remove unhelpful typedefs.

The old typedefs (PCCBox3D) is retained for compatibility, but marked as
deprecated.

This is part of a series attempting to remove unhelpful typedefs.

This is part of a series attempting to remove unhelpful typedefs.

Yiting Shao authored Dec 07, 2018 and David Flynn committed Feb 06, 2019

This partitioning method (--partitionMethod=3) decomposes the input
pointcloud into an octree of depth --partitionOctreeDepth=d, with
each leaf node corresponding to a slice.

Yiting Shao authored Dec 07, 2018 and David Flynn committed Feb 06, 2019

This partitioning method (--partitionMethod=2) finds the longest edge of
the point cloud and divides it into --partitionNumUniformGeom=n slices
along the longest edge.

If n = 0, the ratio of longest edge to shortest edge determines
the number of slices.