Crushing Disks Efficiently
From MaRDI portal
Publication:2819490
DOI10.1007/978-3-319-44543-4_4zbMath1457.68289OpenAlexW2530278705MaRDI QIDQ2819490
Stefan Funke, Sabine Storandt, Filip Krumpe
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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
Agglomerative clustering of growing squares ⋮ Unnamed Item ⋮ Faster algorithms for growing prioritized disks and rectangles
Cites Work
- Unnamed Item
- Unnamed Item
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- 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 dynamic data structure for approximate range searching
- Optimizing active ranges for consistent dynamic map labeling
This page was built for publication: Crushing Disks Efficiently