Maintenance of geometric extrema

DOI10.1145/103516.103518zbMath0799.68106OpenAlexW2046639180MaRDI QIDQ4302837

David P. Dobkin, Subhash Suri

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/103516.103518

zbMATH Keywords

optimizationgeometric algorithmsVoronoi diagramroboticscomputational geometrydecomposabilitydynamizationsemi-online modelVLSI masking

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (7)

Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Dynamic geometric data structures via shallow cuttings ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Minimizing the sum of diameters efficiently ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient splitting and merging algorithms for order decomposable problems.

This page was built for publication: Maintenance of geometric extrema