Embedding ray intersection graphs and global curve simplification

DOI10.1007/978-3-030-92931-2_26OpenAlexW3196494021MaRDI QIDQ2151460

Mees van de Kerkhof, Maarten Löffler, Irina Kostitsyna

Publication date: 1 July 2022

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near-linear time approximation algorithms for curve simplification
• On grid intersection graphs
• Intersection graphs of curves in the plane
• Intersection graphs of segments
• Efficiently approximating polygonal paths in three and higher dimensions
• The Hamiltonian circuit problem for circle graphs is NP-complete
• Algorithmic graph theory and perfect graphs
• Optimal labelling of unit interval graphs
• Integer realizations of disk and segment graphs
• Polygonal path simplification with angle constraints
• Optimal simplification of polygonal chain for rendering
• Topics in Intersection Graph Theory
• Intersection Graphs of Rays and Grounded Segments
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Global Curve Simplification
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
• Refining the hierarchies of classes of geometric intersection graphs
• Streaming algorithms for line simplification

This page was built for publication: Embedding ray intersection graphs and global curve simplification