Motorcycle graphs

DOI10.1145/1963190.2019578zbMath1284.68297OpenAlexW2005965693MaRDI QIDQ5406233

Martin Held, Stefan Huber

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1963190.2019578

zbMATH Keywords

geometric hashingstochastic analysismotorcycle graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

How to Draw a Planarization ⋮ A faster algorithm for computing motorcycle graphs ⋮ How to Draw a Planarization

Uses Software

• Moca
• FIST

This page was built for publication: Motorcycle graphs