Parametrized runtimes for label tournaments

DOI10.1007/978-3-030-36412-0_15zbMATH Open1435.68345OpenAlexW2993379706MaRDI QIDQ2180146FDOQ2180146

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

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

zbMATH Keywords

nearest neighborparametrizationmap labeling

Mathematics Subject Classification ID

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

Cited In (4)

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

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)