Subject: CGAL users discussion list
List archive
- From: "Sebastien Loriot (GeometryFactory)" <>
- To:
- Subject: Re: [cgal-discuss] sort/unique for 3D point list
- Date: Tue, 18 May 2010 09:03:54 +0200
Sebastien Loriot (GeometryFactory) wrote:
Andreas makes me notice that you may be talking about the sort/unique
wrote:
Hi,Hello,
I have no match calling the functions sort and unique for a list of 3D
points (I tried the comparison function K::Less_xyz_3 for sort). Could
you provide me any suggestion?
Thank you in advance!
The sort algorithm requires random access iterators.
Try with a vector instead of a list.
std::vector<Point_3> vect;
std::sort(vect.begin(),vect.end());
S.
member functions of std::list. In that case you can directly use the
function sort() and unique() as operator< are defined for points.
std::list<Point_3> lst;
lst.sort();
lst.unique();
S.
- [cgal-discuss] sort/unique for 3D point list, cecilia, 05/17/2010
- Re: [cgal-discuss] sort/unique for 3D point list, Sebastien Loriot (GeometryFactory), 05/18/2010
- Re: [cgal-discuss] sort/unique for 3D point list, Sebastien Loriot (GeometryFactory), 05/18/2010
- Re: [cgal-discuss] sort/unique for 3D point list, Sebastien Loriot (GeometryFactory), 05/18/2010
Archive powered by MHonArc 2.6.16.