CGAL users discussion list

[Efi Fogel <>]

Hi Luca,

The plane-sweep algorithm (a.k.a. sweep-line) implementation can be viewed as a framework with callbacks to predetermined functions of a visitor. The framework (in general) is implemented as a class template, and the visitor is one of the template parameters of the framework.

Specific operations, such as aggregate insertion, batched decomposition, and map overlay are implemented using a dedicated visitor, which is plugged into the framework class template.

If you had carefully read the book I mentioned, all this would have been more clear to you. In any case, if you really would like to know more you will have to get your feet wet and dig into the code...

Best,

Efi

   ____  _        ____             _
  /_____/_) o    /__________  __  //
 (____ (   (    (    (_/ (_/-(-'_(/
                         _/

On Wed, Nov 26, 2014 at 6:07 PM, lukkio <> wrote:

I've looked both the code and the book too.
I've understood that:
1. The overlay methods rely on sweep line, till here nothing new to me.
2. The sweep line it self rely is implemented by a design pattern "Visitor"
(this is interesting)

In this case i don't understand how the real visitor is implemented for
iterate (i suppose) along the elements on the sweep line and the performs
some operation on such element.

So the question is... how is implemented the visitor for the sweep line?

Lukkio



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/Map-Overlay-implementation-tp4660171p4660176.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://sympa.inria.fr/sympa/info/cgal-discuss