An Interactive Tool to Explore and Improve the Ply Number of Drawings
From MaRDI portal
Publication:4625099
DOI10.1007/978-3-319-73915-1_4zbMath1503.68221arXiv1708.09250OpenAlexW2963103871MaRDI QIDQ4625099
Michael Kaufmann, Niklas Heinsohn
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09250
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
An Experimental Study on the Ply Number of Straight-line Drawings ⋮ On Vertex- and Empty-Ply Proximity Drawings ⋮ Ply
Uses Software
Cites Work
- Unnamed Item
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- CSIDH: an efficient post-quantum commutative group action
- Differential addition on twisted Edwards curves
- Optimized arithmetic operations for isogeny-based cryptography on Huff curves
- Optimized method for computing odd-degree isogenies on Edwards curves
- Isogeny formulas for Jacobi intersection and twisted Hessian curves
- An experimental comparison of four graph drawing algorithms.
- Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves
- Constructing Isogenies on Extended Jacobi Quartic Curves
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Twisted Jacobi Intersections Curves
- The Arithmetic of Elliptic Curves
- Graph Drawing
- Faster computation of isogenies of large prime degree
This page was built for publication: An Interactive Tool to Explore and Improve the Ply Number of Drawings