songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #3086 from afabri/PSP-cite-GF 

Point Set Processing: Use \cgalCite
This commit is contained in:
Sebastien Loriot 2018-05-11 22:55:14 +02:00 committed by GitHub
parent 413682ebc1 7e42e9f5a2
commit d3be4bb075
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Point_set_processing_3/include/CGAL/mst_orient_normals.h
View File

@ -501,11 +501,12 @@ create_mst_graph(
/**
\ingroup PkgPointSetProcessingAlgorithms
Orients the normals of the range of `points` using the propagation
of a seed orientation through a minimum spanning tree of the Riemannian graph [Hoppe92].
of a seed orientation through a minimum spanning tree of the Riemannian graph.
This method modifies the order of input points so as to pack all sucessfully oriented points first,
and returns an iterator over the first point with an unoriented normal (see erase-remove idiom).
For this reason it should not be called on sorted containers.
It is based on \cgalCite{cgal:hddms-srup-92}.
\warning This function may fail when Boost version 1.54 is used,
because of the following bug: https://svn.boost.org/trac/boost/ticket/9012