Computational geometry: an introduction
Computational geometry: an introduction
Mathematica: a system for doing mathematics by computer (2nd ed.)
Mathematica: a system for doing mathematics by computer (2nd ed.)
Properties of some Euclidean proximity graphs
Pattern Recognition Letters
Computational Geometry: Theory and Applications
Cluster busting in anchored graph drawing
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
| Hi-index | 0.00 |
Programming distributed systems with a vast number of processors and communication links requires a method for visualizing the networ k as well as the systems running on the network. In many cases, there is a requirement to draw a graph with an existing layout in order to make the layout more readable. Cluster busting in anchored graph drawing moves the nodes of a graph around in an attempt to make the drawing more readable while keeping the nodes near to their original positions. The Voronoi diagram cluster buster is an algorithm that performs cluster busting in anchored graph drawing. In this paper we present some properties of the Voronoi diagram cluster buster.