Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Vertex_handle

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Vertex_handle


Chronological Thread 
  • From: Andreas Fabri <>
  • To:
  • Subject: Re: [cgal-discuss] Vertex_handle
  • Date: Tue, 07 Oct 2008 21:14:45 +0200


There is probably space to improve the manual, but the notion of "Handle" IS
documented, and
not only at obscure and hard to find places, but right in the beginning of
the user manual of the
triangulation chapter.


25.4.1 Description

The class Triangulation_2<Traits,Tds> serves as a base class for the other 2D
triangulations classes and implements the user interface to a triangulation.

The vertices and faces of the triangulations are accessed through handles, iterators and circulators. A handle is a model of the concept Handle which basically offers the two dereference operators * and -> . A circulator is a type devoted to visit circular sequences. Handles are used whenever the accessed element is not part of a sequence. Iterators and circulators are used to visit all or parts of the triangulation.

Source:
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Triangulation_2/Chapter_main.html


So I insist, please read the manual, and note that there is no need to read
all pages.
The manual is broken down in parts, which are broken down in chapters, which
consist
of a User Manual, many of them with examples, and a Reference Manual.

best regards,

andreas

Juan Pablo Carbajal wrote:
Thanks a lot!
Extremely useful!

JPi


On Tue, Oct 7, 2008 at 8:52 PM, Andreas Fabri
<>
wrote:
Dennis Endt wrote:
Andreas Fabri schrieb:
Dennis Endt wrote:
Hi,

thats my Problem:
/typedef CGAL::Simple_cartesian<double> SK;
typedef CGAL::Filtered_kernel<SK> FK;
struct K : public FK {};

typedef K::Point_3 dPoint;
typedef CGAL::Delaunay_triangulation_3<K> Triangulation;
typedef Triangulation::Vertex_handle Vertex_handle;

Triangulation T;

list<Vertex_handle> vertices; // vector to hold the points of the convex
hull
T.incident_vertices(T.infinite_vertex(), back_inserter(vertices)); //
get the points from Delaunay/

Can anyone plz tell how I get access to the points corresponding to the
vertex_handles? It is very urgent.

I tried everything so far...it cannot be so difficult ;)

Best Dennis
for(list<Vertex_handle>::iterator it = vertices.begin();
it != vertices.end();
++it){
std::cout (*it)->point() << std::endl;
}
Thanks a lot! :)

I only forgot to set the brackets. It can be so easy :)

Best
Dennis

And here comes the "official" link
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Handle_ref/Concept_Handle.html

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








Archive powered by MHonArc 2.6.16.

Top of Page