Parametrized runtimes for label tournaments

DOI10.1007/978-3-030-36412-0_15MaRDI QIDQ2180146zbMATH OpenOpenAlexFDO

Authors Stefan Funke, Sabine Storandt

Publication date 13 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_15

zbMATH Keywords

map labelingnearest neighborparametrization

Mathematics Subject Classification ID

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

Recommendations

• Faster algorithms for growing prioritized disks and rectangles
• scientific article; zbMATH DE number 7278008
• Growing balls in \(\mathbb{R}^d\)
• Crushing disks efficiently
• A unified model and algorithms for temporal map labeling

Cited in

(4)

• Faster algorithms for growing prioritized disks and rectangles
• Crushing disks efficiently
• Growing balls in \(\mathbb{R}^d\)
• Agglomerative clustering of growing squares

This page was built for publication: Parametrized runtimes for label tournaments

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