Efficient maintenance of the union intervals on a line, with applications

Authors:
Siu Wing Cheng;Ravi Janardan
Affiliations:
Department of Computer Science, University of Minnesota, Minneapolis, MN;Department of Computer Science, University of Minnesota, Minneapolis, MN
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 5
Cited 1

An optimal contour algorithm for iso-oriented rectangles

Journal of Algorithms
The contour problem for rectilinear polygons

Information Processing Letters
Computational geometry: an introduction

Computational geometry: an introduction
Time- and space-optimal contour computation for a set of rectangles

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

Discrete & Computational Geometry

The union of probabilistic boxes: maintaining the volume

ESA'11 Proceedings of the 19th European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract