The Science of Fractal Images
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
Feature congestion: a measure of display clutter
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Quantifying the space-efficiency of 2D graphical representations of trees
Information Visualization
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study
IEEE Transactions on Visualization and Computer Graphics
Continuous line drawings via the traveling salesman problem
Operations Research Letters
The Science of Fractal Images
Hi-index | 0.00 |
Rapidly-Exploring Random Trees (RRTs) have been introduced as an algorithmic concept for the rapid exploration of configuration spaces targeting fast path planning, mainly applied in the field of robotics. Typically, such structured space organizations are only used on an algorithmic level but not for direct visual representation. In this paper, we illustrate the aesthetics of such RRTs by displaying them in a visual form that serves as a basis to generate algorithmic art. Apart from the visual encoding of such space-filling node-link diagrams, we demonstrate how these trees grow in the configuration space for RRT layouts with and without incremental distances from the initial point. Additionally, RRTs can be visually enhanced by several inherent tree metrics such as tree depth, subtree size, and branching factors to make the diagrams more aesthetically appealing and readable. We provide examples of different tree sizes and illustrate the effect of changes to several control parameters such as color coding, line segment thickness, layouts, and shape constraints.