Embedding ray intersection graphs and global curve simplification

DOI10.1007/978-3-030-92931-2_26MaRDI QIDQ2151460zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Global Curve Simplification
• scientific article; zbMATH DE number 4142090
• The clique problem in ray intersection graphs
• The Clique Problem in Ray Intersection Graphs
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations

Cites work

• Algorithmic graph theory and perfect graphs
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Efficiently approximating polygonal paths in three and higher dimensions
• Global Curve Simplification
• scientific article; zbMATH DE number 6381690 (Why is no real title available?)
• scientific article; zbMATH DE number 6707504 (Why is no real title available?)
• scientific article; zbMATH DE number 4026646 (Why is no real title available?)
• scientific article; zbMATH DE number 4074316 (Why is no real title available?)
• scientific article; zbMATH DE number 176499 (Why is no real title available?)
• Integer realizations of disk and segment graphs
• Intersection graphs of curves in the plane
• Intersection graphs of rays and grounded segments
• Intersection graphs of segments
• Near-linear time approximation algorithms for curve simplification
• On grid intersection graphs
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Optimal labelling of unit interval graphs
• Optimal simplification of polygonal chain for rendering
• Polygonal path simplification with angle constraints
• Refining the hierarchies of classes of geometric intersection graphs
• Streaming algorithms for line simplification
• The Hamiltonian circuit problem for circle graphs is NP-complete
• Topics in Intersection Graph Theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151460)