CGAL users discussion list

[KHartmann <>]

Hi, 

I have used both the 2D Triangulation and 2D Arrangement classes.
I have found that adding constraint edges to a Triangulation is 
extremely fast regardless of how large the Triangulation grows.  
But I have found, when adding edges to an Arrangement, the insertion
time gets longer and longer as the Arrangement grows.  (I am only adding
straight line segments and x_monotone arcs).

Is this to be expected?  What is the order of these two Algorithms?
It seems that adding a constraint edge to a Triangulation might be
constant time O(1).  But perhaps adding edges to an Arrangement is somewhat
more expensive O( n-squared )?

Are there any tricks that I might use to speed up insertion time into
an Arrangement?  Right now I'm adding edges one at a time in arbitrary
order.

Thanks,
Kevin




--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Data-structure-performance-differences-tp4661842.html
Sent from the cgal-discuss mailing list archive at Nabble.com.