|
||
---|---|---|
|
||
inria-00072510v1
Reports
Minimal Set of Constraints for 2D Constrained Delaunay Reconstruction RR-4119, INRIA. 2001 |
||
hal-00795064v1
Journal articles
Computing Roundness is Easy if the Set is Almost Round International Journal of Computational Geometry and Applications, World Scientific Publishing, 2002, 12 (3), pp.229-248. ⟨10.1142/S0218195902000840⟩ |
||
hal-01179401v1
Conference papers
Splitting a Delaunay Triangulation in Linear Time Proceedings of the 8th European Symposium on Algorithms, 2001, Aarhus, Denmark. pp.312-320, ⟨10.1007/3-540-44676-1_26⟩ |
||
hal-00787186v1
Journal articles
Minimal set of constraints for 2D constrained Delaunay reconstruction International Journal of Computational Geometry and Applications, World Scientific Publishing, 2003, 13 (5), pp.391-398. ⟨10.1142/S0218195903001244⟩ ![]() |
||
|