Year: 1998
Type: conference-paper
Abstract: We show that the well-known random incremental constructlon of Clarkson and Shor [14] can be adapted via gradations to provide efficient external-memory algorithms for some geomctric problems.In particular, as the main result, we obtain an optimal randomized algorithm for the problem of computing the trapezoidal decomposition determined by a set of N line scgmcnts in the plane with K pairwise intersections, that requires G($$ logMjB Q + 5) expected disk accesses (I/OS), where M is the size of the available internal memory and B is the size of the block transfer.The approach is sufficiently general to obtain algorithms for the problems of 2-d and 3-d convex hulls, 2-d abstract Voronoi diagrams and batched point location in a planar subdivision, which require an optimal expected number of I/OS and are olmplcr than the ones previously known.The results extend to a external-memory model with multiple disks.
Authors: A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, E. Ramos
Institutions: Max Planck Society, Max Planck Institute for Informatics
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1519405489
