CGAL users discussion list

[Panagiotis Foteinos <>]

Inside your loop do this:

std::cout << fit->vertex(0)->point(); // the first vertex
std::cout << fit->vertex(1)->point(); //the second
std::cout << fit->vertex(2)->point(); //the third

On Thu, Jun 11, 2009 at 8:33 PM, Matthew Denno <> wrote:

Hi,

I am hoping that someone can point me in the right direction to a
solution for my problem.  I am new to both CGAL and C++ so I apologize
if my questions should be obvious.

I started out with one of the example problems.  After I have added
the points to the Triangulation, I use a Face_iterator to iterate
through the faces (I think through this part is ok).  The problem is I
can't figure out how to access the verticies of each face as I iterate
over them.

If someone could point me in the right direction I would really
appreciate it.  Maybe just a hint of what I should look for in the
manual.

The code I have been testing with is below.

Thanks so much.

Matt

#include <fstream>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Triangulation_2.h>

struct K : CGAL::Exact_predicates_inexact_constructions_kernel {};

typedef CGAL::Triangulation_2<K>         Triangulation;
typedef Triangulation::Vertex_circulator Vertex_circulator;
typedef Triangulation::Point             Point;
typedef Triangulation::Face_iterator     Face_iterator;
typedef Triangulation::Vertex_handle     Vertex_handle;
typedef Triangulation::Vertex_iterator   Vertex_iterator;

int main() {
 std::ifstream in("data/triangulation_prog1.cin");
 std::istream_iterator<Point> begin(in);
 std::istream_iterator<Point> end;

 Triangulation t;
 t.insert(begin, end);

 for (Face_iterator fit = t.faces_begin();
        fit != t.faces_end();
        ++fit){

       //This is where the problem is.
       //print out the x and y coordinates of all three verticies of each face

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