CGAL users discussion list

[Atul Thakur <>]

Hi:
You can store the vertices in a list iterator as follows

#include <CGAL/Cartesian.h>
#include <CGAL/Polygon_2.h>
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/ch_graham_andrew.h>
#include <CGAL/convex_hull_2.h>
#include <vector>
typedef CGAL::Cartesian<double> K;
typedef K::Point_2 Point_2;
typedef CGAL::Polygon_2<K> Polygon;


using namespace std;
int main()
{
  CGAL::set_ascii_mode(std::cin);
  CGAL::set_ascii_mode(std::cout);
  vector <Point_2> pset;
    pset.push_back(Point_2(0,0));
    pset.push_back(Point_2(0,1));
    pset.push_back(Point_2(1,1));
    pset.push_back(Point_2(1,0));
    std::list< Point_2 > L;
    std::insert_iterator<std::list< Point_2 >>  out(L, L.begin());
    CGAL::Object ch_obj;
    Polygon pp;
    list<Point_2> ll;
    CGAL::convex_hull_2( pset.begin(), pset.end(), out );
    for(std::list<Point_2>::iterator it = L.begin(); it!=L.end(); it++)
    {
        Point_2 pp = (Point_2)*it;
    }
  return 0;
}

Hope this helps,

-Atul Thakur

On Tue, Mar 3, 2009 at 11:34 AM, <> wrote:

Hello,
how do i store the result of a convex hull polygon like in the  example using
Graham-Andrew's Algorithm as a polygon? I don't want to write the polygon to a
file or print it on the screen like in the example. I would like to work
directly with the created polygon/convex hull to perform a point inside check.
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss