scientific article; zbMATH DE number 7559226

DOI10.4230/LIPIcs.SoCG.2019.26MaRDI QIDQ5088955

Wolfgang Mulzer, Ravid Cohen, Pankaj K. Agarwal, Dan Halperin

Publication date: 18 July 2022

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

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

zbMATH Keywords

dynamic algorithmsrange searchlower envelopesunit discspseudo-linestentative binary search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

On the geometric priority set cover problem ⋮ Dynamic connectivity in disk graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Maintenance of configurations in the plane
• Spheres, molecules, and hidden surface removal
• On range searching with semialgebraic sets
• Dynamic half-space range reporting and its applications
• Dynamic planar convex hull operations in near-logarithmic amortized time
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Improved algorithms for discs and balls using power diagrams
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• Fine-grained complexity analysis of two classic TSP variants
• Simplex Range Searching and Its Variants: A Review

This page was built for publication: