Crossing minimization in perturbed drawings
From MaRDI portal
Publication:5915943
DOI10.1007/978-3-030-04414-5_16OpenAlexW3163248283MaRDI QIDQ5915943
Publication date: 15 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07608
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Strip planarity testing for embedded planar graphs
- On embedding a cycle in a plane graph
- Intersections of curves on surfaces
- A deleted product criterion for approximability of maps by embeddings
- On approximability by embeddings of cycles in the plane.
- Recognizing weakly simple polygons
- Crossing Number is NP-Complete
- Clustered Planarity with Pipes
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Hanani-Tutte for approximating maps of graphs
- Clustering Cycles into Cycles of Clusters
- Detecting Weakly Simple Polygons
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- Toward a theory of crossing numbers
- How to draw a planar clustered graph
- Planarity for clustered graphs
- Unnamed Item
This page was built for publication: Crossing minimization in perturbed drawings
