The realization problem for Euclidean minimum spanning trees is NP-hard
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Curve and Surface Reconstruction in R2 and R3
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Approximate proximity drawings
GD'11 Proceedings of the 19th international conference on Graph Drawing
Approximate proximity drawings
Computational Geometry: Theory and Applications
Hi-index | 0.00 |