Dynamic Algorithms in Computational Geometry

Authors:
Yi Chiang;Roberto Tamassia
Affiliations:
-;-
Venue:
Dynamic Algorithms in Computational Geometry
Year:
1991

Citing 0
Cited 8

Dynamization of the trapezoid method for planar point location (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic algebraic algorithms

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Space efficient dynamic orthogonal range reporting

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A data structure for multi-dimensional range reporting

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Design of B+tree-based predicate index for efficient event matching

APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Conflict-Free Coloring of points on a line with respect to a set of intervals

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Research on dynamic algorithms for geometric problems has received increasing attention in the last years and is motivated by many important applications in circuit layout, computer graphics, and computer-aided design. In this paper we survey dynamic algorithms and data structures in the area of computational geometry. Our work has a twofold purpose: it introduces the area to the nonspecialist and overviews the state-of-the-art for the specialist.