mirror of https://github.com/CGAL/cgal
29 lines
781 B
Plaintext
29 lines
781 B
Plaintext
== To follow Triangle ==
|
||
|
||
- Implement off-centers
|
||
|
||
- Implement Chew’s algorithm instead of Ruppert's
|
||
|
||
L. Paul Chew, ‘‘Guaranteed−Quality Mesh Generation for Curved
|
||
Surfaces,’’ Proceedings of the Ninth Annual Symposium on Computational
|
||
Geometry, pages 274−280, May 1993.
|
||
|
||
- Implement Miller-Pav-Walkington
|
||
|
||
Gary L. Miller, Steven E. Pav, and Noel J. Walkington, ‘‘When and Why
|
||
Ruppert’s Algorithm Works,’’ Twelfth International Meshing Roundtable,
|
||
pages 91−102, September 2003.
|
||
|
||
|
||
== Old TODO list ==
|
||
|
||
- Implement a method to split all clusters at the beginnning.
|
||
|
||
- Histograms in the demo
|
||
|
||
- do not use default constructor of Geom_traits
|
||
|
||
- Rewrite Double_map.h [!]
|
||
|
||
- draw() called twice in mesh_demo [!]
|