CGAL users discussion list

[Andreas Fabri <>]

The vertex is the infinite vertex




 wrote:
> Here is my (simple) code (only the necessary parts of course):
>
> struct K : CGAL::Exact_predicates_inexact_constructions_kernel {};
> typedef CGAL::Triangulation_euclidean_traits_xy_3<K> Gt;
> typedef CGAL::Delaunay_triangulation_2<Gt> Delaunay;
>
> Delaunay dt;
>
> void
> siaDelaunay::SetVerticies(std::vector<std::vector<float> > points)
> {
>   this->PrintSelf();
>   for (std::vector<std::vector<float> >::const_iterator it = points.begin() ;
>        it != points.end() ;
>        it++) {
>     cgalPoint P((*it)[0], (*it)[1], (*it)[2]);
>     this->dt.insert(P);
>     this->PrintSelf();
>   }
>   this->PrintContent();
> }
>
> PrintSelf() prints current verticies/edges/faces #
> PrintContent() prints verticies geometry
>
> and here is the (surprising) output when a single vertex is added to the 
> triangulation:
>
> siaDelaunay: 1 verticies, 0 edges, 0 faces
> siaDelaunay: 2 verticies, 0 edges, 0 faces
> siaDelaunay: -1.992622 20358369408.661587 -1.992669
> siaDelaunay: 42.200001 37.599998 0.000000
>
> which means that the triangulation already contains an invalid vertex just 
> after being created!!
> Any explaination?