Off-line dynamic maintenance of the width of a planar point set

DOI10.1016/0925-7721(91)90001-UzbMath0764.68163OpenAlexW4245033320MaRDI QIDQ1190292

Micha Sharir, Pankaj K. Agarwal

Publication date: 27 September 1992

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(91)90001-u

zbMATH Keywords

off-line dynamic maintenancewidth of a planar point set

Mathematics Subject Classification ID

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

Related Items (7)

Dynamic coresets ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Reconfiguring closed polygonal chains in Euclidean \(d\)-space ⋮ Average case analysis of dynamic geometric optimization ⋮ Computing grasp functions ⋮ Continuous location of dimensional structures. ⋮ Two approaches to building time-windowed geometric data structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to the dynamic maintenance of maximal points in a plane
• Maintenance of configurations in the plane
• Batched dynamic solutions to decomposable searching problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms

This page was built for publication: Off-line dynamic maintenance of the width of a planar point set