CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Nearest neighbors might be useful.

See:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Spatial_searching/Chapter_main.html

Sebastien.

On 03/09/2012 09:50 AM, cnng0315 wrote:
> In Gis,  we often have obtained an array of 3d or 2d Points,  one of the most
> common process is to remove such point whose distance to its neighbor is
> less than a custom valeu(eg. 1mm ).
>
>         // Kernel
>         typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
>
>         // Simple geometric types
>         typedef K::FT FT;
>         typedef K::Point_3 Point;
>          std::set<Point>  PointList;
>
> with the method above, we can remove Points whose x,y,z are the same. but
> the problem is, in real world, two poins are considered to be the same if
> these distance is less than a small value.
> So, dose cagl provide some good method to solve this problem?
>
> -----
> technology change life!
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Remove-Points-whose-distance-with-each-other-less-than-a-custom-value-tp4458878p4458878.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.