Abstract

This thesis explores novel methods for rendering edges between nodes in a graph focusing on aesthetic appeal. Combining a dual grid approach with a pathfinding algorithm and post-processing techniques utilizing Bezier curves aimed to produce visually pleasing representations of hierarchical hypergraphs. The research addresses the challenge of presenting complex graph structures comprehensibly and visually appealingly, crucial for various fields such as data visualization and network analysis. The approach presented in this paper and its corresponding code implementation offer a promising direction for graph visualization, providing improved clarity and aesthetics in representing relationships between entities within hierarchical hypergraphs.

Results/Implementation/Project Description

Conclusion

[ PDF (optional) ] 

[ Slides Kickoff/Final (optional)]