Subject: CGAL users discussion list
List archive
[cgal-discuss] Re: How should I implement my own surface simplification algorithm?
Chronological Thread
- From: tang <>
- To:
- Subject: [cgal-discuss] Re: How should I implement my own surface simplification algorithm?
- Date: Mon, 20 Aug 2012 21:59:59 -0700 (PDT)
Hi Sebastien,
I need to simplify surface meshes after boolean operations of polyhedrons.
The rules to simplify meshes are:
1) |p_i-p_j|<d_eps
2) area(triangle)<area_eps
How can I implement the simplification?
The code to do boolean operations is as follows:
Polyhedron *obj;
Polyhedron *subobj;
...
Nef_polyhedron nef_obj(*obj);
Nef_polyhedron nef_subobj(*subobj);
nef_obj = nef_obj + nef_subobj;
/// how to do mesh simplification to 'nef_obj'?
Thanks,
Zhanhgong Tang
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/How-should-I-implement-my-own-surface-simplification-algorithm-tp4347083p4655749.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] Re: How should I implement my own surface simplification algorithm?, tang, 08/21/2012
Archive powered by MHonArc 2.6.18.