Showing papers by "Jan van Leeuwen published in 1981"
TL;DR: A fully dynamic maintenance algorithm for convex hulls that can process insertions and deletions of single points in only O(log* n) steps per transaction, where n is the number of points currently in the set.
505 citations
105 citations
TL;DR: An algorithm is presented for Klee's measure problem that has a worst-case running time of only O(nd−1) for d⩾3 and is based on quad-trees and requires quadratic storage for d > 2.
79 citations
TL;DR: A technique is described for dynamizing data structures of common types of decomposable searching problems, yielding good worst-case bounds rather than merely good average bounds on all operations to be performed on the resulting structures.
23 citations
TL;DR: Over the past two years, much effort has been devoted to obtaining general dynamization methods for various classes of problems, for which such general techniques indeed exist.
16 citations
31 Aug 1981
TL;DR: A number of general techniques that were developed for dynamizing decomposable searching problems and a recent solution to Bentley's original question to devise a dynamization method for such problems with worst-case optimal insertion and deletion routines are discussed.
Abstract: A few years ago J Bentley initiated a general approach to searching problems and their solution by means of dynamic data structures As it is often easier to find a static solution first, his goal was to obtain efficient dynamic data structures by applying transformations to static data structures This approach has become a paradigm (known as "dynamization") in current research in the design of efficient algorithms We shall outline a number of general techniques that were developed for dynamizing decomposable searching problems and will discuss a recent solution to Bentley's original question to devise a dynamization method for such problems with worst-case optimal insertion and deletion routines
11 citations