CGAL users discussion list

[horstmann <>]

Hi everyone!

If I had a triangulation as follows:

    std::vector<Point> P;

    for(i=0;i<*nsphere;i++)     
                // Add point to triangulation
                P.push_back(Point(coord[pos],coord[pos+1],coord[pos+2]));

    Delaunay dt(P.begin(), P.end());

1. Then, is there a "global" order of the Finite_Cells respect to the whole
triangulation¿?
i.e., a global index of each Finite_Cell between the range [0 ,
dt.number_of_finite_cells()-1 ]
Is it possible to get that index?¿

2. Is it possible to compare two Cell_handle's as pointers, in order to know
if they point to the same cell¿?

    typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
    typedef CGAL::Delaunay_triangulation_3<K, CGAL::Fast_location>      
Delaunay;
    typedef Delaunay::Cell_handle Cell_handle;

    Cell_handle ch1,ch2;
     ... assign someything
*    if (ch1 == ch2) ....... *

Does it make sense?? 
If not, is it possible to compare to cell's ?¿


Thanks a lot in advance!!
EDU

--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Triangulation-global-Cell-s-order-and-Cell-handle-comparation-tp4626363.html
Sent from the cgal-discuss mailing list archive at Nabble.com.