Lower bounds for kinetic planar subdivisions (1999) [10 citations — 7 self]

Download:

by Pankaj K. Agarwal, Julien Basch, Mark De Berg, Leonidas J. Guibas, John Hershberger

In Proc. 15th ACM Symp. on Computational Geometry

ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1999/1999-40.ps.gz

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Agarwal99lowerbounds,
    author = {Pankaj K. Agarwal and Julien Basch and Mark De Berg and Leonidas J. Guibas and John Hershberger},
    title = {Lower bounds for kinetic planar subdivisions},
    booktitle = {In Proc. 15th ACM Symp. on Computational Geometry},
    year = {1999},
    pages = {247--254}
}

Abstract:

We revisit the notion of kinetic eciency for non-canonically-dened discrete attributes of moving data, like binary space partitions and triangulations. Under very general computational models, we obtain lower bounds on the minimum amount of work required to maintain any binary space partition of moving segments in the plane or any Steiner triangulation of moving points in the plane. Such lower bounds|the rst to be obtained in the kinetic context|are necessary to evaluate the eciency of kinetic data structures when the attribute to be maintained is not canonically dened. 1

Citations

692	Multidimensional binary search trees used for associative searching – Bentley - 1975
204	Data structures for mobile data – Basch, Guibas, et al. - 1999
194	Geometric range searching and its relatives – Agarwal, Erickson - 1999
152	Quad trees: a data structure for retrieval on composite keys – Finkel, Bentley - 1974
54	Study for Applying Computer-Generated Images to Visual Simulation – Schumacker, Brand, et al. - 1969
50	Some dynamic computational geometry problems – Atallah - 1985
44	Optimization of the Binary Space Partition Algorithm (BSP) for Visualization of Dynamic scenes. Computer Graphics Forum(EUROGRAPHICS '90 proceedings – Torres - 1990
33	Interactive Solid Geometry Via Partitioning Trees – Naylor - 1992
25	Binary space partitions for fat rectangles – Agarwal, Grove, et al. - 1993
24	The Design and Analyses of Spatial Data Structures – Samet - 1989
23	Computation for 3D Interaction and Animation – Shadow - 1996
16	A model for data in motion – Kahan - 1991
15	Kinetic collision detection for two simple polygons – Basch, Erickson, et al.
9	Dynamical sets of points – Ottmann, Wood - 1984
7	Kinetic binary space partitions for triangles – Agarwal, Erickson, et al. - 1998
5	Maintaining the extent of a moving set of points – Agarwal, Guibas, et al. - 1997
1	Kinetic maintenance of triangulations and pseudo-triangulations – Basch, Berg, et al.
1	Triangulations. Handbook of Discrete and Computational Geometry – Bern - 1997

View or Download | Add to My Collection | Correct Errors