Crushing disks efficiently

DOI10.1007/978-3-319-44543-4_4zbMATH Open1457.68289OpenAlexW2530278705MaRDI QIDQ2819490FDOQ2819490

Authors: Stefan Funke, Filip Krumpe, Sabine Storandt 

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_4

Recommendations

• Faster algorithms for growing prioritized disks and rectangles
• scientific article; zbMATH DE number 7278008
• Growing balls in \(\mathbb{R}^d\)
• Parametrized runtimes for label tournaments
• Intersection queries in sets of disks

Mathematics Subject Classification ID

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

Cites Work

• A dynamic data structure for approximate range searching
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• Title not available (Why is that?)
• Optimizing active ranges for consistent dynamic map labeling
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• A perturbation scheme for spherical arrangements with application to molecular modeling
• Controlled perturbation for Delaunay triangulations

Cited In (5)

• Faster algorithms for growing prioritized disks and rectangles
• Agglomerative clustering of growing squares
• Title not available (Why is that?)
• Parametrized runtimes for label tournaments
• Growing balls in \(\mathbb{R}^d\)

This page was built for publication: Crushing disks efficiently

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