The drawability problem for minimum weight triangulations
Theoretical Computer Science
Computational Geometry: Theory and Applications
Proximity Drawings: Three Dimensions Are Better than Two
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
γ-Observable neighbours for vector quantization
Neural Networks - New developments in self-organizing maps
Proximity drawings in polynomial area and volume
Computational Geometry: Theory and Applications
Polynomial area bounds for MST embeddings of trees
Computational Geometry: Theory and Applications
On the area requirements of Euclidean minimum spanning trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the area requirements of Euclidean minimum spanning trees
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |