CGAL users discussion list

[Marco Aurelio Sterpa <>]

Hi Ben,

maybe the code was not enough clear, I use the zone function not to insert another line, but given a static (will never change again) arrangament, I need to get a given line represented with Halfedges. So what I do is computing the zone of that line and then ignore the Face_handle inside it. It seems to me that for iteration is the the reason of a slow computation, so is there another more efficient way of getting the halfedge of a given (all one for iteration) line in the arrangement?

2009/11/5 Sylvain Pion <>

Ben Supnik a écrit :

Sorry, what I meant to write was: "I don't think any of the kernels have SLOWER than constanttime operation".

I guess that it really depends how you count.  In practice and in general,
I would not state anything like that.

Sylvain: in the case of some of the lazy kernels is it possible that time performance of the whole algorithm could be improved by the reduction of entire sets of geometric or numeric operations that can be eliminated when the DAG is evaluated?

It's hard to detect this at the kernel level.  The kernel is meant to deal
with the numeric issues.

Of course...if this was possible, the algorithm running on top of the kernel would be rather poorly written.

I agree.  Unfortunately, sometimes reality is suboptimal...

Still, I am excited for the wonderful future of sub-constant time operations. :-)

Wait for quantum computers :)

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/

--

You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss