Dynamic algorithms in computational geometry

Dynamic algorithms and data structures in the area of computational geometry are surveyed. The work has a twofold purpose: it introduces the area to the nonspecialist and reviews the state of the art for the specialist. Fundamental data structures, such as balanced search trees and general techniques for dynamization, are reviewed. Range searching, intersections, point location, convex hull, and proximity are discussed. Problems that do not fall into these categories are also discussed. Open problems are given. >

[1]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[2]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..

[3]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 1 , 1984, EATCS.

[4]  Franco P. Preparata,et al.  An optimal real-time algorithm for planar convex hulls , 1979, CACM.

[5]  Subhash Suri,et al.  Applications of a semi-dynamic convex hull algorithm , 1990, BIT.

[6]  Dan E. Willard.  Multidimensional search trees that provide new types of memory reductions , 1987, JACM.

[7]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.

[8]  Kurt Mehlhorn,et al.  Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity , 1990 .

[9]  Dan E. Willard,et al.  Applications of the fusion tree method to computational geometry and searching , 1992, SODA '92.

[10]  David P. Dobkin,et al.  Dynamically computing the maxima of decomposable functions, with applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[12]  JanardanRavi,et al.  Efficient maintenance of the union of intervals of a line, with applications , 1991 .

[13]  Ravi Janardan.  On Maintaining the Width and Diameter of a Planar Point-Set Online , 1991, ISA.

[14]  Franz Aurenhammer,et al.  A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams , 1991, SCG '91.

[15]  Siu-Wing Cheng,et al.  Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications , 1991, SODA '91.

[16]  Roberto Tamassia,et al.  Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..

[17]  Ketan Mulmuley.  Randomized multidimensional search trees: further results in dynamic sampling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  Michael Ian Shamos,et al.  A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications. , 1978 .

[19]  Marshall W. Bern,et al.  Hidden surface removal for rectangles , 1988, SCG '88.

[20]  Pankaj K. Agarwal,et al.  Ray shooting and other applications of spanning trees with low stabbing number , 1992, SCG '89.

[21]  Ketan Mulmuley,et al.  Dynamic point location in arrangements of hyperplanes , 1991, SCG '91.

[22]  Susan H. Rodger,et al.  A new approach to the dynamic maintenance of maximal points in a plane , 1990, Discret. Comput. Geom..

[23]  Mark H. Overmars,et al.  Concatenable Segment Trees (Extended Abstract) , 1989, STACS.

[24]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[25]  M. J. van Kreveld,et al.  Maintaining range trees in secondary memory. Part I: Partitions , 1987 .

[26]  Kurt Mehlhorn,et al.  Optimal Dynamization of Decomposable Searching Problems , 1981, Inf. Process. Lett..

[27]  Micha Sharir,et al.  Planar geometric location problems and maintaining the width of a planar set , 1991, SODA '91.

[28]  George S. Lueker,et al.  A Data Structure for Dynamic Range Queries , 1982, Inf. Process. Lett..

[29]  Mark H. Overmars,et al.  General Methods for Adding Range Restrictions to Decomposable Searching Problems , 1989, J. Symb. Comput..

[30]  R. Tarjan.  Amortized Computational Complexity , 1985 .

[31]  Rolf Klein,et al.  Priority Search Trees in Secondary Memory (Extended Abstract) , 1987, WG.

[32]  Mark H. Overmars,et al.  Dynamization of Order Decomposable Set Problems , 1981, J. Algorithms.

[33]  Rajeev Motwani,et al.  Deferred Data Structuring , 1988, SIAM J. Comput..

[34]  Dan E. Willard,et al.  On the application of sheared retrieval to orthogonal range queries , 1986, SCG '86.

[35]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[36]  Michiel H. M. Smid.  Maintaining the minimal distance of a point set in polylogarithmic time , 1991, SODA '91.

[37]  Bernard Chazelle,et al.  Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..

[38]  S. Sitharama Iyengar,et al.  On the dynamization of data structures , 1988, BIT Comput. Sci. Sect..

[39]  Michiel H. M. Smid,et al.  Dynamic Deferred Data Structuring , 1990, Inf. Process. Lett..

[40]  Franz Aurenhammer,et al.  A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams , 1992, Int. J. Comput. Geom. Appl..

[41]  Michiel H. M. Smid,et al.  An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem , 1992, SODA.

[42]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[43]  Michiel Smid.  Range trees with slack parameter , 1991 .

[44]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[45]  Michael L. Fredman,et al.  A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.

[46]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[47]  S. Sitharama Iyengar,et al.  Multidimensional Data Structures: Review and Outlook , 1988, Adv. Comput..

[48]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[49]  Ravi Janardan,et al.  On the Dynamic Maintenance of Maximal Points in the Plane , 1991, Inf. Process. Lett..

[50]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[51]  Jan van Leeuwen,et al.  Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds , 1981, Theoretical Computer Science.

[52]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

[53]  Robert E. Tarjan,et al.  Biased Search Trees , 1985, SIAM J. Comput..

[54]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[55]  Micha Sharir,et al.  Applications of a New Space Partitioning Technique , 1991, WADS.

[56]  Roberto Tamassia,et al.  Dynamic Planar Point Location with Optimal Query Time , 1990, Theor. Comput. Sci..

[57]  Siu-Wing Cheng,et al.  Algorithms for Ray-Shooting and Intersection Searching , 1992, J. Algorithms.

[58]  Ketan Mulmuley,et al.  Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract) , 1991, SCG.

[59]  Roberto Tamassia,et al.  Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..

[60]  Michael L. Fredman,et al.  BLASTING through the information theoretic barrier with FUSION TREES , 1990, STOC '90.

[61]  Mark de Berg.  Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra , 1992, Comput. Geom..

[62]  M. Smid.  Maintaining the minimal distance of a point set in less than linear time , 1990 .

[63]  Dennis J. Volper,et al.  Data Structures for Retrieval on Square Grids , 1986, SIAM J. Comput..

[64]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

[65]  Jan van Leeuwen,et al.  Some Principles for Dynamizing Decomposable Searching Problems , 1981, Inf. Process. Lett..

[66]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[67]  Mark H. Overmars,et al.  Concatenable Structures for Decomposable Problems , 1994, Inf. Comput..

[68]  I. G. Gowda,et al.  Dynamic Voronoi diagrams , 1983, IEEE Trans. Inf. Theory.

[69]  Sven Moen,et al.  Drawing dynamic trees , 1990, IEEE Software.

[70]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[71]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

[72]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[73]  Mark H. Overmars,et al.  Range searching in a set of line segments , 1985, SCG '85.

[74]  Mark H. Overmars,et al.  Union-copy structures and dynamic segment trees , 1993, JACM.

[75]  Peter van Emde Boas,et al.  Preserving order in a forest in less than logarithmic time , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[76]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[77]  M. Smid.  A worst-case algorithm for semi-online updates on decomposable problems , 1990 .

[78]  Rajeev Raman,et al.  Persistence, amortization and randomization , 1991, SODA '91.

[79]  D. Willard,et al.  The Super-B-Tree Algorithm. , 1979 .

[80]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[81]  David Maier,et al.  Hysterical B-trees , 1981, Inf. Process. Lett..

[82]  Michael T. Goodrich.  Applying parallel processing techniques to classification problems in constructive solid geometry , 1990, SODA '90.

[83]  Vijay K. Vaishnavi,et al.  Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization , 1982, J. Algorithms.

[84]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[85]  Samuel Watkins Bent.  Dynamic weighted data structures , 1982 .

[86]  Siu-Wing Cheng,et al.  Efficient Dynamic Algorithms for Some Geometric Intersection Problems , 1990, Inf. Process. Lett..

[87]  H. Edelsbrunner.  A new approach to rectangle intersections part I , 1983 .

[88]  P. Van Remoortere.  Book reviewThe art and theory of dynamic programming : S.E. Dreyfus, A.M. Law: Published by Academic Press N.Y. in 1977, 310 pages, US $18.50, ISBN 0-12-221860-4 , 1979 .

[89]  Mark H. Overmars,et al.  Dynamic Partition Trees , 1990, SWAT.

[90]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[91]  R. Tamassia,et al.  Dynamic expression trees and their applications , 1991, SODA '91.

[92]  Subhash Suri,et al.  Offline maintenance of planar configurations , 1991, SODA '91.

[93]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[94]  Jan van Leeuwen,et al.  Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems , 1981, Inf. Process. Lett..

[95]  Edward M. Reingold,et al.  Binary search trees of bounded balance , 1972, SIAM J. Comput..

[96]  Jeffrey Scott Vitter,et al.  A Simplified Technique for Hidden-Line Elimination in Terrains , 1992, STACS.

[97]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.

[98]  Mariette Yvinec,et al.  Dynamic location in an arrangement of line segments in the plane , 1991 .

[99]  Michiel H. M. Smid,et al.  Dynamic data structures on multiple storage media , 1989 .

[100]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[101]  Mariette Yvinec,et al.  Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds , 1990, SWAT.

[102]  Kurt Mehlhorn,et al.  Robust Balancing in B-Trees , 1981, Theoretical Computer Science.

[103]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[104]  Michael L. Fredman,et al.  The inherent complexity of dynamic data structures which accommodate range queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[105]  Jirí Matousek,et al.  Spanning trees with low crossing number , 1991, RAIRO Theor. Informatics Appl..

[106]  Vijay K. Vaishnavi.  Multidimensional Balanced Binary Trees , 1989, IEEE Trans. Computers.

[107]  Kurt Mehlhorn,et al.  A new data structure for representing sorted lists , 1980, Acta Informatica.

[108]  George S. Lueker,et al.  A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[109]  Jon Louis Bentley,et al.  K-d trees for semidynamic point sets , 1990, SCG '90.

[110]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[111]  Jan van Leeuwen,et al.  Dynamization of Decomposable Searching Problems , 1980, Inf. Process. Lett..

[112]  Ioannis G. Tollis,et al.  Algorithms for automatic graph drawing: an annotated bibliography , 1994 .

[113]  Dan E. Willard.  Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems , 1989, Inf. Comput..

[114]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[115]  Kenneth J. Supowit,et al.  New techniques for some dynamic closest-point and farthest-point problems , 1990, SODA '90.

[116]  Ketan Mulmuley,et al.  On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..

[117]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[118]  Roberto Tamassia,et al.  Efficient Spatial Point Location (Extended Abstract) , 1989, WADS.

[119]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[120]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[121]  Siu-Wing Cheng,et al.  Efficient maintenance of the union intervals on a line, with applications , 1991, SODA '90.

[122]  Mariette Yvinec,et al.  Computation of the axial view of a set of isothetic parallelepipeds , 1990, TOGS.

[123]  Matthew Dickerson,et al.  Enumerating k distances for n points in the plane , 1991, SCG '91.

[124]  Roberto Tamassia,et al.  An Incremental Reconstruction Method for Dynamic Planar Point Location , 1991, Inf. Process. Lett..

[125]  Kurt Mehlhorn,et al.  Dynamic point location in general subdivisions , 1992, SODA '92.

[126]  Steven Fortune,et al.  Stable maintenance of point set triangulations in two dimensions , 1989, 30th Annual Symposium on Foundations of Computer Science.

[127]  Ketan Mulmuley.  Randomized multidimensional search trees: lazy balancing and dynamic shuffling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[128]  Vijay K. Vaishnavi,et al.  Computing Point Enclosures , 1982, IEEE Transactions on Computers.

[129]  Robert E. Tarjan,et al.  Updating a Balanced Search Tree in O(1) Rotations , 1983, Inf. Process. Lett..

[130]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[131]  Leonidas J. Guibas,et al.  Randomized Incremental Construction of Delaunay and Voronoi Diagrams , 1990, ICALP.

[132]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[133]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[134]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[135]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[136]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[137]  Roberto Tamassia,et al.  Dynamic Planar Point Location with Optimal Query Time , 1990, Theor. Comput. Sci..

[138]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[139]  Kurt Mehlhorn,et al.  On the Average Number of Rebalancing Operations in Weight-Balanced Trees , 1980, Theor. Comput. Sci..

[140]  Roberto Tamassia,et al.  Dynamization of the trapezoid method for planar point location (extended abstract) , 1991, SCG '91.

[141]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[142]  Takao Asano,et al.  Dynamic Orthogonal Segment Intersection Search , 1987, J. Algorithms.

[143]  Roberto Tamassia,et al.  A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.

[144]  Arne Andersson,et al.  Improving Partial Rebuilding by Using Simple Balance Criteria , 1989, WADS.

[145]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[146]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[147]  Kurt Mehlhorn,et al.  Dynamization of geometric data structures , 1985, SCG '85.

[148]  Jan van Leeuwen,et al.  The Art of Dynamizing , 1981, MFCS.

[149]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[150]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[151]  Philippe Flajolet,et al.  Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations , 1989, WADS.

[152]  Herbert Edelsbrunner,et al.  Rectangular Point Location in d Dimensions with Applications , 1986, Comput. J..

[153]  Jeffrey S. Salowe.  Shallow Interdistnace Selection and Interdistance Enumeration , 1991, WADS.