scientific article; zbMATH DE number 7278008

DOI10.4230/LIPIcs.ISAAC.2017.3zbMath1457.68272arXiv1704.07580MaRDI QIDQ5136216

André van Renssen, Hee-Kap Ahn, Ji-won Park, Antoine Vigneron, Wolfgang Mulzer, Jong Min Choi, Sang Won Bae, Eunjin Oh, Matias Korman

Publication date: 25 November 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

map labelingelimination ordergrowing disks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Cites Work

• Finding the upper envelope of n line segments in O(n log n) time
• Crushing Disks Efficiently
• Almost tight upper bounds for vertical decompositions in four dimensions
• Computing Envelopes in Four Dimensions with Applications
• Growing Balls in ℝ^d
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item