CGAL users discussion list

[freckles <>]

Thanks for the reply. 

I've read those docs, and now I'm going through the Lindstrom_Turk
implementation code. But the concept I am struggling with is how the costs
for all the vertices are stored, after which the edges with the least cost
are selected and collapsed. 

I know that internally a priority queue is used by the Edge_collapse class.
However the thing I can't figure out is, when CGAL tries to GetCost, will
the cost be re-calculated for that edge? What happens after the collapse of
a selected edge? Will the cost will be re-calculated for the edges involved
as well? 

There must be something I'm missing, it all just seems so confusing. 



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/How-should-I-implement-my-own-surface-simplification-algorithm-tp4347083p4350331.html
Sent from the cgal-discuss mailing list archive at Nabble.com.