A Contrario 3D Point Alignment Detection Algorithm
Please cite the reference article if you publish results obtained with this online demo.

This is an implementation of a 3D Point Alignment Detector.

Use an example:

250 noise points

Two alignments in noise

A (planar)

Border (planar)

Cube (planar)

Grid (planar)

Kinect reduced data

Multiple alignments

100 noise points (planar)

Perfect Alignment

Masking by Structure (planar)


Create your data

Create your own data

Upload Data

Upload your own dots files to use as the algorithm input.

 

The uploaded text file shall be formatted such that each line contains a triple of x, y, z coordinates, or a pair of x, y coordinates separated by spaces. In case of pairs the third coordinate is assumed zero. Coordinates must be real numbers. The domain for the algorithm is computed from the limits of the data. 500 points is the maximum allowed.
Example:
0.1523418 0.8593640 0.4594350
0.1933569 0.8242082 0.1233458
0.2460906 0.7851462 0.7536375
...