Localized Cocone surface reconstruction

We introduce a surface reconstruction algorithm suitable for large point sets. The algorithm is an octree-based version of the Cocone reconstruction algorithm [4], allowing independent processing of small subsets of the total input point set. When the points are sufficiently sampled from a smooth surface, the global guarantee of topological correctness of the original algorithm is preserved, together with the geometric accuracy guarantees.

Graphical AbstractLocalized Cocone surface reconstruction on the ArmadilloFigure optionsDownload high-quality image (53 K)Download as PowerPoint slideHighlights
► We provide an octree-based Cocone reconstruction algorithm which operates locally.
► A global computation of Delaunay tetrahedralization is avoided.
► Large input point sets can be handled.
► Topological correctness and geometric accuracy are guaranteed for well sampled data.