Subject: CGAL users discussion list
List archive
- From: Bernhard Kornberger <>
- To:
- Subject: [cgal-discuss] Bug: Neighbor_search segfaults
- Date: Mon, 20 Oct 2008 14:33:51 +0200
Hello,
Neighbor_search segfaults in my code. But only if there are several
very similar points in the search tree. The segfault occurs in the
line with "Neighbor_search search(tree,q,1)" as shown below:
typedef CGAL::Exact_predicates_exact_constructions_kernel K;
typedef CGAL::Search_traits_3<K> TreeTraits;
typedef CGAL::Euclidean_distance<TreeTraits> Distance;
typedef CGAL::Fair<TreeTraits> Fair;
typedef CGAL::Orthogonal_k_neighbor_search<TreeTraits,Distance,Fair> Neighbor_search;
typedef Neighbor_search::Tree Tree;
typedef K::Point_3 Point;
Tree tree;
typedef map<Point,pCellInfo> CiMap;
CiMap mPointCI;
for(Finite_cells_iterator c_it=T->finite_cells_begin();
c_it!=T->finite_cells_end();++c_it)
{
Point polePoint=c_it->info()->getCenter();
if(mPointCI.insert(make_pair(polePoint,c_it->info())).second)
{
tree.insert(polePoint);
}
else cout << "Not inserted, duplicate"<<endl;
}
for(Finite_vertices_iterator v_it=T->finite_vertices_begin();
v_it!=T->finite_vertices_end();++v_it)
{
Point q=v_it->point();
Neighbor_search search(tree,q,1); <- This line crashes!!
Other details: CGAL331, g++ (GCC) 4.2.3, Linux. Is this a known bug? Any
hints?
Thank you/Best regards
Bernhard
- [cgal-discuss] Bug: Neighbor_search segfaults, Bernhard Kornberger, 10/20/2008
Archive powered by MHonArc 2.6.16.