Snapping Graph Drawings to the Grid Optimally

DOI10.1007/978-3-319-50106-2_12zbMath1478.68249arXiv1608.08844OpenAlexW2513393005MaRDI QIDQ2961511

Thomas C. van Dijk, Andre Löffler, Alexander Wolff

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.08844

Mathematics Subject Classification ID

Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Snapping Graph Drawings to the Grid Optimally

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• An intersection-sensitive algorithm for snap rounding
• Minimum-width grid drawings of plane graphs
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Incremental Grid-Like Layout Using Soft and Hard Constraints
• Snapping Graph Drawings to the Grid Optimally
• Rounding Arrangements Dynamically
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Minimizing the Area for Planar Straight-Line Grid Drawings
• How to Draw a Graph

This page was built for publication: Snapping Graph Drawings to the Grid Optimally