Inserting an edge into a geometric embedding
From MaRDI portal
Publication:5915946
DOI10.1007/978-3-030-04414-5_29OpenAlexW2887100597MaRDI QIDQ5915946
Ignaz Rutter, Marcel Radermacher
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/1807.11711
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
How to Draw a Planarization ⋮ Inserting an edge into a geometric embedding ⋮ Inserting one edge into a simple drawing is hard ⋮ Quantitative Restrictions on Crossing Patterns ⋮ An effective crossing minimisation heuristic based on star insertion
Cites Work
- Unnamed Item
- Unnamed Item
- On shortest disjoint paths in planar graphs
- The directed subgraph homeomorphism problem
- The disjoint shortest paths problem
- Inserting an edge into a planar graph
- Crossing Number is NP-Complete
- Straight-Line Drawability of a Planar Graph Plus an Edge
- A Geometric Heuristic for Rectilinear Crossing Minimization
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Parameterized Algorithms
- Inserting an edge into a geometric embedding
This page was built for publication: Inserting an edge into a geometric embedding
