A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space

07/17/2020
by   Yury Elkin, et al.
0

The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in ℝ^m up to a certain error. A practical solution to this problem will accelerate a discovery of new colloidal products with desired physical properties such as viscosity. We define the Approximate Skeleton of any finite point cloud C in a Euclidean space with theoretical guarantees. The Approximate Skeleton ASk(C) always belongs to a given offset of C, i.e. the maximum distance from C to ASk(C) can be a given maximum error. The number of vertices in the Approximate Skeleton is close to the minimum number in an optimal tree by factor 2. The new Approximate Skeleton of any unorganized point cloud C is computed in a near linear time in the number of points in C. Finally, the Approximate Skeleton outperforms past skeletonization algorithms on the size and accuracy of reconstruction for a large dataset of real micelles and random clouds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2020

A novel tree-structured point cloud dataset for skeletonization algorithm evaluation

Curve skeleton extraction from unorganized point cloud is a fundamental ...
research
01/10/2019

Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees

Real datasets often come in the form of an unorganised cloud of points. ...
research
01/10/2019

Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise

Data Science aims to extract meaningful knowledge from unorganised data....
research
10/09/2013

Linear Algorithm for Digital Euclidean Connected Skeleton

The skeleton is an essential shape characteristic providing a compact re...
research
05/18/2018

Approximate Data Depth Revisited

Halfspace depth and β-skeleton depth are two types of depth functions in...
research
01/15/2020

Optimal Skeleton Huffman Trees Revisited

A skeleton Huffman tree is a Huffman tree in which all disjoint maximal ...
research
01/07/2018

Reconstructing a convex polygon from its ω-cloud

An ω-wedge is the (closed) set of all points contained between two rays ...

Please sign up or login with your details

Forgot password? Click here to reset