CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Not sure to understand what you want, are you looking for
number_of_finite_cells()  and co. ?
http://doc.cgal.org/latest/Triangulation_3/classCGAL_1_1Triangulation__3.html#a6a1038f90773f98e76176ea55ed752f2

On 04/29/2014 12:44 PM, Adam Getchell wrote:
> Hello all,
>
> If I run this code:
>
> https://github.com/acgetchell/CDT-plusplus/tree/seed
>
> And in particular, this function:
>
> template <typename T>
> void make_S3_simplicial_complex(T* S3, int number_of_simplices, int
> number_of_timeslices) {
>    // Start with a 3D sphere with two simplices
>    S3->insert(typename T::Point(0,0,0));
>    S3->insert(typename T::Point(1, 0, 0));
>    S3->insert(typename T::Point(0, 1, 0));
>    S3->insert(typename T::Point(0, 0, 1));
>    //S3->insert(typename T::Point(0, 0, -1));
>    // /In 3D with an infinite point we'll get 4 vertices, 10 edges
>    /// 10 facets and 5 cells. The point at $\infty$ isn't counted
>    /// but the edges, facets, and cells generated by it are
>
>    assert(S3->dimension() == 3);
>
>    std::cout  << "Initial seed has " << S3->number_of_vertices()
>          << " vertices and "
>          << S3->number_of_edges() << " edges and "
>          << S3->number_of_facets() << " facets"
>          << " and " << S3->number_of_cells() << " cells" << std::endl;
>
>    assert(S3->dimension() == 3);
>    assert(S3->is_valid());
> }
>
> I will get counts of edges, facets, and cells that represent the ones
> generated by the infinite 5th point of the 3D simplex. Is this correct
> behavior, and if so, what should I do to get the correct count of edges,
> facets, and cells?
>
> Thanks for any pointers,
>
> --
> Adam Getchell
> about.me/adamgetchell <http://about.me/adamgetchell>
> "Invincibility is in oneself, vulnerability in the opponent." -- Sun Tzu