Data structures for mobile data

Data structures for mobile data (1997)

Cached

Download Links

by Julien Basch , Leonidas J. Guibas , John Hershberger

Venue:	JOURNAL OF ALGORITHMS
Citations:	215 - 49 self

BibTeX

@INPROCEEDINGS{Basch97datastructures,
    author = {Julien Basch and Leonidas J. Guibas and John Hershberger},
    title = {Data structures for mobile data},
    booktitle = {JOURNAL OF ALGORITHMS},
    year = {1997},
    pages = {747--756},
    publisher = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

A kinetic data structure (KDS) maintains an attribute of interest in a system of geometric objects undergoing continuous motion. In this paper we develop a conceptual framework for kinetic data structures, propose a number of criteria for the quality of such structures, and describe a number of fundamental techniques for their design. We illustrate these general concepts by presenting kinetic data structures for maintaining the convex hull and the closest pair of moving points in the plane; these structures behavewell according to the proposed quality criteria for KDSs.

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 1997
1611	Computational geometry: An introduction - Preparata, Shamos - 1985
371	Davenport-Schinzel sequences and their geometric applications - Agarwal, Sharir - 1998
247	Algorithms for reporting and counting geometric intersections - Bentley, Ottmann - 1979
141	Leeuwen. Maintenance of configurations in the plane - Overmars, van - 1981
88	Applications of parametric searching in geometric optimization - Toledo, Agarwal, et al. - 1994
81	Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput - Sharir - 1994
80	Efficient algorithms for incremental distance computation - Lin, Canny - 1991
55	Finding the upper envelope of n line segments in o(n log n - Hershberger - 1989
48	Proximity problems on moving points - Basch, Guibas, et al. - 1997
46	Applications of a semi-dynamic convex hull algorithm - Hershberger, Suri - 1990
45	Some dynamic computational geometry problems - Atallah - 1985
38	Parallel Computational Geometry - Akl, Lyons - 1993
37	Voronoi diagrams of moving points in the plane - Guibas, Mitchell, et al. - 1991
35	Constructing belts in two-dimensional arrangements with applications - Edelsbrunner, Welzl - 1986
34	An optimal algorithm for closest-pair maintenance - Bespamyatnikh - 1998
33	Algorithms for dynamic closest-pair and n-body potential fields - Callahan, Kosaraju - 1995
29	Cylindrical static and kinetic binary space partitions - Agarwal, Guibas, et al. - 1997
26	Kinetic collision detection between two simple polygons - Basch, Erickson, et al.
24	The overlay of lower envelopes and its applications. Discrete Comput - Agarwal, Schwarzkopf, et al. - 1996
22	Voronoi diagrams of moving points in the plane - Fu, Lee - 1991
19	A practical evaluation of kinetic data structures - Basch, Guibas, et al. - 1997
17	Maintaining the extent of a moving point set - Agarwal, Guibas, et al.
16	Voronoi Diagrams over Dynamic Scenes - Roos - 1990
13	Leewen. Maintenance of con gurations in the plane - Overmars, van - 1981
11	New techniques for exact and approximate dynamic closest-point problems - Kapoor, Smid - 1996
10	Sweeping lines and line segments with a heap - Basch, Guibas, et al. - 1997
10	Randomized data structures for the dynamic closest-pair problem - Golin, Raman, et al. - 1998
8	Separation-sensitive kinetic collision detection for convex objects - Erickson, Guibas, et al. - 1999
7	Dynamical sets of points - Ottmann, Wood - 1984
7	Comments on “Algorithms for reporting and counting geometric intersections - Brown - 1981
6	Kinetic binary space partitions for triangles - Agarwal, Erickson, et al. - 1998
3	Comments on "Algorithms for reporting and counting geometric intersections - Brown - 1981
2	Revenge of the dog: Queries on Voronoi diagrams of moving points - Devillers, Golin, et al. - 1994
2	Incremental collision detection for polygonal models - Ponamgi, Lin, et al. - 1995
1	The overlay oflower envelopes and its applications. Discrete Comput - Agarwal, Schwarzkopf, et al. - 1996