diff --git a/_posts/2024-05-29-Kinetic_surface_reconstruction.md b/_posts/2024-05-29-Kinetic_surface_reconstruction.md index b04ca7394..e34fda48d 100644 --- a/_posts/2024-05-29-Kinetic_surface_reconstruction.md +++ b/_posts/2024-05-29-Kinetic_surface_reconstruction.md @@ -37,7 +37,7 @@ tags: [""]
Polygon mesh only. -

While the reconstruction pipeline has several parameters, which are directly passed to methods from the Shape Detection package and Shape Regularization package, the Kinetic Space Partition and Kinetic Surface Reconstruction package add a few parameters to give the user control over the reconstruction. The complexity of the surface can be adapted to favor simpler surfaces, i.e., with a lower polygon count.

+

While the reconstruction pipeline has several parameters, which are directly passed to methods from the Shape Detection package and Shape Regularization package, the Kinetic Space Partition and Kinetic Surface Reconstruction add a few parameters to give the user control over the reconstruction. The complexity of the surface can be adapted to favor simpler surfaces, i.e., with a lower polygon count.

The occupancy labeling may consider the sides of the bounding boxes as empty space, e.g., for the reconstruction of objects, or individually as occupied space, e.g., the bottom or ground side in the case of aerial LiDAR. Also the bounding box for the space partition can be axis-aligned or oriented without transforming the input data.

@@ -45,13 +45,13 @@ tags: [""]

-
Reconstruction of aerial LiDAR of a church with different complexity parameters.
(middle right) shows the reconstruction with an axis-aligned bounding box and (left) sets the bottom bounding box face to be labeled as empty. +
Reconstruction of aerial LiDAR of a church with different complexity parameters.
(middle right) shows the reconstruction with an axis-aligned bounding box and (right) sets the bottom bounding box face to be labeled as empty.

Kinetic Space Partition

-

The major challenges of space decomposition and labeling methods are high computational complexity, and a large number of small cells which are caused by the often indefinite extension of planar shapes. The Kinetic Space Partition overcomes these limitations by following a kinetic approach: planar input shapes are not extended indefinitely, but extend over time until they collide with other input shapes. A user-provided parameter to adjust the overall complexity of the partition limits the extension of shapes after a number of intersections with other shapes. Thus, the Kinetic Space Partition is a subset of a full plane arrangement and small input shapes are limited to only have a local impact on the partition.

+

The major challenges of space decomposition and labeling methods are high computational complexity and a large number of small cells which are caused by the often indefinite extension of planar shapes. The Kinetic Space Partition overcomes these limitations by following a kinetic approach: planar input shapes are not extended indefinitely, but extend over time until they collide with other input shapes. A user-provided parameter to adjust the overall complexity of the partition limits the extension of shapes after a number of intersections with other shapes. Thus, the Kinetic Space Partition is a subset of a full plane arrangement and small input shapes are limited to only have a local impact on the partition.

A subdivision by using an octree allows to split up the input shapes into smaller Kinetic Space Partitions and thus provide a significant speedup. The mechanism is fully transparent as the smaller partitions are fused into one conformal partition.