On the realisability of double-cross matrices by polylines in the plane
DOI10.1016/J.JCSS.2016.12.001zbMATH Open1370.68299OpenAlexW2564070451MaRDI QIDQ2396825FDOQ2396825
Authors: Bart Kuijpers, Bart Moelans 
Publication date: 26 May 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/21222
Recommendations
- Some provably hard crossing number problems
- Graphs that admit polyline drawings with few crossing angles
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- On the size of graphs that admit polyline drawings with few bends and crossing angles
- Polygons with prescribed angles in 2D and 3D
computational algebraic geometryspatial reasoningalgorithmic complexitydouble-cross calculusqualitative description of polylines
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Software engineering and complexity in effective algebraic geometry
- Kronecker's smart, little black boxes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Understanding and using linear programming
- Size and shape spaces for landmark data in two dimensions (with discussion)
- Shape, Procrustes tangent projections and bilateral symmetry
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial algorithms for linear programming over the algebraic numbers
Uses Software
This page was built for publication: On the realisability of double-cross matrices by polylines in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396825)
