Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Spatial Searching: How to cope with duplicate points?

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Spatial Searching: How to cope with duplicate points?


Chronological Thread 
  • From: "Sebastien Loriot (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] Spatial Searching: How to cope with duplicate points?
  • Date: Fri, 22 Oct 2010 09:19:11 +0200

Sebastian Kapfer wrote:
Hallo!

I was able to reproduce that on one of my machines, with your last code+data, with -O1, but not with -O0. It is probably a compiler bug. I do not understand it well.

Weird. I tried with GCC 4.4.3 which is the latest version I can get
my hands at without compiling GCC from source. It's still buggy.

I also tried Intel C++ a minute ago:

$ icpc --version
icpc (ICC) 11.0 20090609
Copyright (C) 1985-2009 Intel Corporation. All rights reserved.

Same message, aborts in line 267, even with -O0 and -fp-model strict.

Hm. :-(

I will try to see whether this is a bug in CGAL code.
In the mean time, I saw in your sample code that you are using a fixed
number of neighbors. If this is the case in your main code,
you can use Orthogonal_k_neighbor_search which will be faster than the incremental version.


S.



Archive powered by MHonArc 2.6.16.

Top of Page