CelticGraph: Drawing Graphs as Celtic Knots and Links
Peter Eades, Niklas Gr\"one, Karsten Klein, Patrick Eades, Leo, Schreiber, Ulf Hailer, Falk Schreiber
TL;DR
CelticGraph is a novel framework that visualizes graphs as Celtic knots and links, integrating combinatorial graph theory with artistic knot representations using Bézier curves.
Contribution
It introduces a new algorithm for representing graph edges as smooth Bézier curves in Celtic knot and link visualizations, bridging art and graph theory.
Findings
Developed a Celtic knot drawing algorithm for graphs
Demonstrated the use of Bézier curves for smooth link representations
Connected combinatorial graph concepts with artistic knot visualization
Abstract
Celtic knots are an ancient art form often attributed to Celtic cultures, used to decorate monuments and manuscripts, and to symbolise eternity and interconnectedness. This paper describes the framework CelticGraph to draw graphs as Celtic knots and links. The drawing process raises interesting combinatorial concepts in the theory of circuits in planar graphs. Further, CelticGraph uses a novel algorithm to represent edges as B\'ezier curves, aiming to show each link as a smooth curve with limited curvature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Art, Technology, and Culture · Graph Theory and Algorithms