A new approach to the dynamic maintenance of maximal points in a plane

20Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A point pi=(xi, yi) in the x-y plane is maximal if there is no point pj=(xj, yj) such that xj>xi and yj>yi. We present a simple data structure, a dynamic contour search tree, which contains all the points in the plane and maintains an embedded linked list of maximal points so that m maximal points are accessible in O(m) time. Our data structure dynamically maintains the set of points so that insertions take O(log n) time, a speedup of O(log n) over previous results, and deletions take O((log n)2) time. © 1990 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Frederickson, G. N., & Rodger, S. (1990). A new approach to the dynamic maintenance of maximal points in a plane. Discrete & Computational Geometry, 5(1), 365–374. https://doi.org/10.1007/BF02187797

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free