Presents a scalable randomized algorithm for geometric crossing minimization, including a theoretical approximation guarantee for vertex repositioning and experimental results on graphs with up to 13,000 edges.
Inserting Multiple Edges into a Planar Graph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Geometric Crossing-Minimization -- A Scalable Randomized Approach
Presents a scalable randomized algorithm for geometric crossing minimization, including a theoretical approximation guarantee for vertex repositioning and experimental results on graphs with up to 13,000 edges.