Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs

DOI10.1007/978-3-319-73915-1_12zbMath1504.05194arXiv1708.09778OpenAlexW2750689360MaRDI QIDQ4625107

Veronika Irvine, Therese C. Biedl

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.09778

zbMATH Keywords

polygonal schemalace graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

The weighted barycenter drawing recognition problem ⋮ Quasiperiodic bobbin lace patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient redactable signature and application to anonymous credentials
• Dissemination of authenticated tree-structured data with privacy protection and fine-grained control in outsourced databases
• A General Framework for Redactable Signatures and New Constructions
• Redactable Signatures for Independent Removal of Structure and Content
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• A Storage Efficient Redactable Signature in the Standard Model
• Trapdoors for hard lattices and new cryptographic constructions
• Unlinkability of Sanitizable Signatures
• Redactable Signatures for Tree-Structured Data: Definitions and Constructions
• Security of Sanitizable Signatures Revisited
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• On Updatable Redactable Signatures
• Periodic Planar Straight-Frame Drawings with Polynomial Resolution
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures