scientific article

DOI10.20382/jocg.v8i2a5zbMath1362.65027arXiv1603.06972MaRDI QIDQ2978407

Valentin Polishchuk, Maarten Löffler, Frank Staals, Irina Kostitsyna

Publication date: 24 April 2017

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computer graphicscomplexity boundspolynomial-time approximation schememinimum-link path problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items

Rectilinear link diameter and radius in a rectilinear polygonal domain ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Embedding ray intersection graphs and global curve simplification ⋮ Smoothing the Gap Between NP and ER ⋮ The complexity of drawing a graph in a polygonal region ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Global Curve Simplification