CGAL users discussion list

[Menelaos Karavelas <>]

Could you also send your code, that is the program that you use to  
produce the results below?

- m.

On 23 Apr 2010, at 11:04, Bai wrote:

> Thanks very much for replying.
> I've just tested the insertion into segment Delaunay Graph, the  
> tests were
> performed on the same data set, the segment set is actually a  
> discrete line,
> containing about 8000 segnent connecting each other
> sequentially at endpoints. The different size of input is controlled  
> simply
> changing the number of input segments.
>
> The following are the results, still very slow, (time unit is ms):
>
> Result 1: EK= Simple_cartesian<double>
> 50 segments are read in
> 15.5716
> 200 segments are read in
> 72.0865
> 250 segments are read in
> 93.0119
> 500 segments are read in
> 305.27
> 1000 segments are read in
> 1347.81
> 2500 segments are read in
> 8496.68
> 3000 segments are read in
> 12208.4
>
> Still, when 5000 segment are read in, my program corrupted.
>
> Result 2: EK=Simple_cartesian<ENT>
> 50 segments are read in
> 2577.35
> 200 segments are read in
> 25875.1
> 250 segments are read in
> 35973.3
> 500 segments are read in
> 104792
> 1000 segments are read in
> 338392
> 2500 segments are read in
> 1.51143e+006
>
> I did not test on size more than 2500 .
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Problems-on-segment-Voronoi-diagram-tp2023020p2034004.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss