CGAL users discussion list

[Efi Fogel <>]

Use point location, such as CGAL::Arr_landmarks_point_location?

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

On Sun, Apr 27, 2014 at 6:43 AM, dg <> wrote:

Hello,

I need to find a vertex or edge iterator from an arrangement_2 data
structure.
Now, given the vertex (x,y) or the segment (<x1,y1>, <x2,y2>), Can I  do a
O(1) lookup into the arrangement_2 and get the corresponding vertex or edge
iterator ?

Currently, I am doing it in a naive way in which I iterate through all the
vertices using vertex_iterator and searching for the required one. the other
approach I have in mind is to create a hash map of the iterators.

Thanks.
dg.



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/vertex-and-edge-iterator-for-arrangment-2-tp4659208.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