CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

In triangulations, iterators are over vertices and not over handles.
If you want to avoid the copy of vertex iterators (which are implicitly
convertible to vertex handle) into your own container, you need to write
an iterator on top of the vertex iterator, where operator* returns the
handle.

For example, you can use boost::iterator_facade for this.

Sebastien.

Karen Daniels wrote:
>  How do we obtain an iterator to an iterable collection(vector, list, 
> deque) of vertex_handles to all points in a triangulation? (There should 
> be exactly 1 vertex handle for each point).
>
>         - Karen Daniels
>
> -------------------------------------------
>
> Karen Daniels, Ph.D.
> Associate Professor
> Department of Computer Science
> University of Massachusetts Lowell
>
> One University Avenue
> Olsen Hall, Room 216
> Lowell, MA 01854
>
> Phone: 978-934-3631
> Fax: 978-934-3551
> Email: 
>
> URL: http://www.cs.uml.edu/~kdaniels