Patricio Vela: Course Wiki

This is an old revision of the document!

The Advancing Fronts Algorithm

The kind of algorithm we'll be palying with is an advancing front algorithm, Early version of such algorithms include Ball pivoting algorithm (BPA). Some related algorithms require the surface to be defined implicitly.

Since this course does not have the pre-requisites required to implement the algorithm from scratch (a good algorithms course), I have written a primitive version of the algorithm then removed some of the key code. Your task is to flesh it out, then to apply it to several point clouds with different processing parameters, and communicate your findings. All of the necessary scripts and code stubs can be found here (TODO).

Other References

C.E. Scheidegger, S. Fleishman, C.T. Silva. “Triangulating Point Set Surfaces with Bounded Error.” Eurographics Symposium on Geometry Processing, 2005. pdf, open source code
Z.C. Marton, R.B. Rusu, M. Beetz. “On Fast Surface Reconstruction Methods for Large and Noisy Point Clouds.” ICRA, 2009. paper, code in PCL
D.J. Mavrilipis. “An Advancing Front Delaunay Triangulation Algorithm Designed for Robustness.” Journal of Computational Physics, 117(1):90-101, 1995. presentation slides , paper
Lots more by just googling: advancing fronts algorithm.

Back