4 ms·
I once tried implementing the classical Delaunay triangulation algorithm from scratch and got close to a good solution, but never could iron out some major bugs
by j2kun 12y ago
I once tried implementing the classical Delaunay triangulation algorithm from scratch and got close to a good solution, but never could iron out some major bugs. I think of it as a testament to the difficulty of algorithms and computational geometry.
- minopret 12y agoThere's a very clear exposition and implementation in the book and code library _The Stanford Graphbase_. It's reasonably simple for the computer. It's not so simple for the algorithm designer.