Abstract
We present an O(n log n)-time algorithm to solve the three-dimensional layers-of-maxima problem. This is an improvement over the prior O(n log n log log n)-time solution. A previous claimed O(n log n)-time solution due to Atallah et al. has technical flaws. Our algorithm is based on a common framework underlying previous work, but to implement it we devise a new data structure to solve a special case of dynamic planar point location in a staircase subdivision. Our data structure itself relies on a new extension to dynamic fractional cascading that allows vertices of high degree in the control graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Buchsbaum, A., Goodrich, M. Three-Dimensional Layers of Maxima. Algorithmica 39, 275–286 (2004). https://doi.org/10.1007/s00453-004-1082-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-004-1082-5