Pith. sign in

REVIEW

CelticGraph: Drawing Graphs as Celtic Knots and Links

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.02852 v2 pith:54L6RMLI submitted 2023-09-06 cs.CG

CelticGraph: Drawing Graphs as Celtic Knots and Links

classification cs.CG
keywords celticcelticgraphgraphsknotsdrawinglinksaimingalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.