CGAL users discussion list

[Andreas Fabri <>]

Hello,

I just had a look at the code. The problem is that it calls
incident_cells, which is implemented recursively, and for a
vertex with many incident cells, as in your case the infinite
vertex, the stack is full.

We have to put it on our todo list.  A temporary solution
might be to increase the stack size. I think for VC++ you
should use the linker command /STACK

http://msdn.microsoft.com/en-us/library/8cxs58a6(VS.80).aspx

Best regards,

andreas


Shuchu wrote:
> Hi, all,
>
> Why the operation "Triangulation_3.incident_vertices( )"  show different 
> results when in different compiler?
>
> In my code , a CGAL::Triangulation_3 is built by using the method in 
> "<CGAL/Triangulation_incremental_builder_3.h> " .
>
> I try to find all vertices  that incident to the infinite vertex. the 
> code is as follow:
> //////////////////////////////////////////////
> CGAL::Triangulation_3<>      original_tet;                   ........
> std::vector<Vertex_handle>  vertices_incident_infinite;
> Vertex_handle infinite_p = original_tet.infinite_vertex();
> original_tet.incident_vertices( infinite_p , std::back_inserter( 
> vertices_incident_infinite));
> .........
> //////////////////////////////////////////
>
> this part of code is working fine under the GCC  compiler  ( cygwin-gcc).
> but in Vc2005,  when  debugging,  the debugger throw an exception and 
> say  "stack overflow" at " original_tet.incident_vertices().."
> like: " Unhandled exception at 0x00424ce9 in ****.exe: 0xC00000FD: Stack 
> overflow."
>
>
> Should I be careful when using this operation under VC2005?
>
>
>
> Best Regards
> Han shuchu