mirror of https://github.com/CGAL/cgal
48 lines
1.7 KiB
Plaintext
48 lines
1.7 KiB
Plaintext
- suppress function set_number_of_vertices(int )
|
|
- Regular_triangulation_2 : remplacer degenerate_power_test_2(p,q,r)
|
|
par power_test_2(p,q,r)
|
|
- add examples for Triangulation hierarchy
|
|
and for the use of both Constrained_plus and triangulation hierarchy
|
|
- corriger le figure "three_layers" dans la doc
|
|
|
|
- Check if copy constructor and assignement operator of
|
|
constrained riangulation transfers the contrained marks.
|
|
- Something still tobe done for remove in Constrained
|
|
Delaunay_constrained and Constrained_triangulation_plus
|
|
- Harmoniser find_conflicts() avec le 3d
|
|
- tester entree vrml
|
|
- eclaircir ce qui arrive
|
|
quand il y a des points en trop dand un fichier d'entre .off
|
|
- faire des fonctions globales pour les entrees sorties
|
|
les mettre dans un fichier separe
|
|
pour ne pas etre oblige d'inclure iostream obligatoirement
|
|
|
|
- constrained_triangulation_plus_2 plante sur Sun CC
|
|
- Constraint_hierarchy_3
|
|
to be done or redone : copy swap and delete
|
|
|
|
|
|
- k orderVoronoi diagram (code de Julia)
|
|
- Natural neighbor (code de Franck)
|
|
- mesh 2d (stage de Mihaella)
|
|
- Constrained_triangulation_3 (stage de Douc)
|
|
- Conforming triangulation (David)
|
|
- Vrml output
|
|
- Triangulation_2_traits_3 :
|
|
a traits is needed for the case where points are not exactly coplanar
|
|
but where the unit normal to the plane is known.
|
|
This could solve some robustness issues
|
|
|
|
|
|
- rendre les iterator vraiment const
|
|
creer les classe const_handle
|
|
|
|
A verifier
|
|
- Corriger la doc pour includes_edge in Triangulation_2
|
|
- test removal and meshing functions in constrained
|
|
and Delaunay constrained triangulation
|
|
- mesh
|
|
- add set_weight(Weight w) to weighted point
|
|
- iterator de faces intersectees par un segment
|
|
- oriented_side ne marche pas quand le point est sur un sommet...
|