On the realisability of double-cross matrices by polylines in the plane

DOI10.1016/J.JCSS.2016.12.001MaRDI QIDQ2396825zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational algebraic geometryspatial reasoningalgorithmic complexitydouble-cross calculusqualitative description of polylines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cites work

• scientific article; zbMATH DE number 3968699 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 1194132 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 2044758 (Why is no real title available?)
• scientific article; zbMATH DE number 1753151 (Why is no real title available?)
• scientific article; zbMATH DE number 2112020 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Algorithms in real algebraic geometry
• Kronecker's smart, little black boxes
• Polynomial algorithms for linear programming over the algebraic numbers
• Shape, Procrustes tangent projections and bilateral symmetry
• Size and shape spaces for landmark data in two dimensions (with discussion)
• Software engineering and complexity in effective algebraic geometry
• Understanding and using linear programming

Describes a project that uses

Uses Software

• Mathematica
• REDLOG

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)