Skip to content

Commit

Permalink
Update readme with link to new website and release v1.1.3 info
Browse files Browse the repository at this point in the history
  • Loading branch information
nmellado committed Sep 28, 2017
1 parent 0d9bda6 commit fc5bdb1
Showing 1 changed file with 11 additions and 11 deletions.
22 changes: 11 additions & 11 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,17 +7,23 @@ An implementation of the Super 4-points Congruent Sets (Super 4PCS) algorithm pr
> Nicolas Mellado, Dror Aiger, Niloy J. Mitra
> Symposium on Geometry Processing 2014.
Copyright 2014 Nicolas Mellado

Authors: Nicolas Mellado, Dror Aiger

Linux and MacOS: [![Build Status](https://api.travis-ci.org/nmellado/Super4PCS.svg?branch=master)](https://travis-ci.org/nmellado/Super4PCS)
[stsimg-linux]: https://api.travis-ci.org/nmellado/Super4PCS.svg?branch=master
[stsimg-windw]: https://ci.appveyor.com/api/projects/status/reg4cmhn309w1s8k/branch/master?svg=true

| Linux - MacOS | Windows |
| :----: | :-----: |
| ![stsimg-linux] | ![stsimg-windw] |

Documentation: [http://nmellado.github.io/Super4PCS/] (http://nmellado.github.io/Super4PCS/)

Paper project page: [http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS](http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS)

Windows: [![Build Status](https://ci.appveyor.com/api/projects/status/reg4cmhn309w1s8k/branch/master?svg=true)](https://ci.appveyor.com/project/nmellado/super4pcs)

Getting started instructions: [here](https://github.com/nmellado/Super4PCS/wiki/Getting-started).

## News
* 28th September 2017: Super4PCS [v1.1.3](https://github.com/nmellado/Super4PCS/releases/tag/v1.1.3) is out, providing a new Meshlab plugin, PCL wrapper, doxygen-generated documentation (online [here] (http://nmellado.github.io/Super4PCS/)) and several bug fixes.
* 24th August 2017: Super4PCS [v1.1.2](https://github.com/nmellado/Super4PCS/releases/tag/v1.1.2) introduces Super4PCS CMake package, better testing (including on Windows plateform), cleaner code structure (moved demos away from library code).
* 10th August 2017: Super4PCS [v1.1.1](https://github.com/nmellado/Super4PCS/releases/tag/v1.1.1) introduces minor fixes from previous release.
* 10th August 2017: Super4PCS [v1.1.0](https://github.com/nmellado/Super4PCS/releases/tag/v1.1.0) is available, improving performances, fixing use as C++ library, and generalizing CI use.
Expand All @@ -28,11 +34,5 @@ Getting started instructions: [here](https://github.com/nmellado/Super4PCS/wiki/
* 3rd May 2016: Super4PCS [v0.2-alpha](https://github.com/nmellado/Super4PCS/releases/tag/v0.2-alpha) is out !
* 23th March 2016: Super4PCS can now be compiled with Visual Studio 2015! Checkout the [Wiki](http://github.com/nmellado/Super4PCS/wiki) for more details.

## Related pages
* For everyone: [Sup4PCS website](http://nmellado.github.io/Super4PCS/): news, gallery, tutorials, ...
* For users: [Sup4PCS wiki](http://github.com/nmellado/Super4PCS/wiki): compilation instruction, usage, ...
* For researchers and advanced users: [paper project page](http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS).


## Paper Abstract
> Data acquisition in large-scale scenes regularly involves accumulating information across multiple scans. A common approach is to locally align scan pairs using Iterative Closest Point (ICP) algorithm (or its variants), but requires static scenes and small motion between scan pairs. This prevents accumulating data across multiple scan sessions and/or different acquisition modalities (e.g., stereo, depth scans). Alternatively, one can use a global registration algorithm allowing scans to be in arbitrary initial poses. The state-of-the-art global registration algorithm, 4PCS, however has a quadratic time complexity in the number of data points. This vastly limits its applicability to acquisition of large environments. We present Super 4PCS for global pointcloud registration that is optimal, i.e., runs in linear time (in the number of data points) and is also output sensitive in the complexity of the alignment problem based on the (unknown) overlap across scan pairs. Technically, we map the algorithm as an ‘instance problem’ and solve it efficiently using a smart indexing data organization. The algorithm is simple, memory-efficient, and fast. We demonstrate that Super 4PCS results in significant speedup over alternative approaches and allows unstructured efficient acquisition of scenes at scales previously not possible. Complete source code and datasets are available for research use at http://geometry.cs.ucl.ac.uk/projects/2014/super4PCS/.

0 comments on commit fc5bdb1

Please sign in to comment.