Multi-functional geometric data structures

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

[1]  Dieter W. Fellner,et al.  Easy Realignment of k-DOP Bounding Volumes , 2003, Graphics Interface.

[2]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[3]  H. V. Jagadish.  Spatial search with polyhedra , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[4]  Y Yuechen Qian,et al.  Data synchronization and browsing for home environments , 2004 .

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Hanan Samet,et al.  Applications of spatial data structures - computer graphics, image processing, and GIS , 1990 .

[7]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[8]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[9]  P. Boas.  Machine models and simulations , 1991 .

[10]  Jan Vahrenhold,et al.  External Memory Computational Geometry Revisited , 2002, Algorithms for Memory Hierarchies.

[11]  Micha Sharir,et al.  Storing line segments in partition trees , 1990, BIT Comput. Sci. Sect..

[12]  Peter van Oosterom,et al.  Reactive Data Structures for Geographic Information Systems , 1993 .

[13]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[14]  Peter Widmayer,et al.  Spatial Data Structures: Concepts and Design Choices , 1996, Algorithmic Foundations of Geographic Information Systems.

[15]  Dinesh Manocha,et al.  Fast distance queries with rectangular swept sphere volumes , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[16]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[17]  Michael T. Goodrich,et al.  Balanced aspect ratio trees: combining the advantages of k-d trees and octrees , 1999, SODA '99.

[18]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[19]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[20]  Mark de Berg,et al.  New Results on Binary Space Partitions in the Plane , 1997, Comput. Geom..

[21]  Jeffrey Scott Vitter,et al.  Implementing I/O-efficient Data Structures Using TPIE , 2002, ESA.

[22]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[23]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[24]  T. M. Murali,et al.  Binary Space Partitions for Fat Rectangles , 2000, SIAM J. Comput..

[25]  Jeffrey Scott Vitter,et al.  A Framework for Index Bulk Loading and Dynamization , 2001, ICALP.

[26]  Lars Arge.  External memory data structures , 2002 .

[27]  A. Frank van der Stappen,et al.  Motion planning amidst fat obstacles , 1993 .

[28]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.

[29]  Joachim Gudmundsson,et al.  Box-trees for collision checking in industrial installations , 2002, SCG '02.

[30]  Steven K. Feiner,et al.  Near real-time shadow generation using BSP trees , 1989, SIGGRAPH '89.

[31]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[32]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[33]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[34]  Mark de Berg,et al.  Guarding scenes against invasive hypercubes , 2003, Comput. Geom..

[35]  Csaba D. Tóth.  A Note on Binary Plane Partitions , 2003, Discret. Comput. Geom..

[36]  Mark de Berg,et al.  Motion Planning in Environments with Low Obstacle Density , 1998, Discret. Comput. Geom..

[37]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[38]  T. M. Murali,et al.  Practical techniques for constructing binary space partitions for orthogonal rectangles , 1997, SCG '97.

[39]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[40]  Yannis Manolopoulos,et al.  Advanced Database Indexing , 1999, Advances in Database Systems.

[41]  Michael T. Goodrich,et al.  K-D Trees Are Better when Cut on the Longest Side , 2000, ESA.

[42]  M. B. van der Zwaag,et al.  Models and logics for process algebra , 2002 .

[43]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[44]  Csaba D. Tóth.  Binary space partitions for line segments with a limited number of directions , 2002, SODA '02.

[45]  F. Frances Yao,et al.  Optimal binary space partitions for orthogonal objects , 1990, SODA '90.

[46]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[47]  John Amanatides,et al.  Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.

[48]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[49]  Sunil Arya,et al.  Approximate range searching , 2000, Comput. Geom..

[50]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[51]  F. Alkemade,et al.  Evolutionary agent-based economics , 2004 .

[52]  Marc J. van Kreveld.  On fat partitioning, fat covering and the union size of polygons , 1998, Comput. Geom..

[53]  Joseph S. B. Mitchell,et al.  Query-Sensitive Ray Shooting , 1997, Int. J. Comput. Geom. Appl..

[54]  Micha Sharir,et al.  Computing Depth Orders for Fat Objects and Related Problems , 1995, Comput. Geom..

[55]  Mark de Berg,et al.  Realistic input models for geometric algorithms , 1997, SCG '97.

[56]  Martijn M. Schrage,et al.  Proxima: a presentation-oriented editor for structured documents , 2000 .

[57]  Mark de Berg.  Linear Size Binary Space Partitions for Uncluttered Scenes , 2000, Algorithmica.

[58]  Ambuj K. Singh,et al.  Optimal Dynamic Range Searching in Non-replicating Index Structures , 1999, ICDT.

[59]  H. Haverkort.  Results on geometric networks and data structures , 2004 .

[60]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[61]  Andres Löh,et al.  Exploring generic Haskell , 2004 .

[62]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[63]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[64]  Steven M. LaValle,et al.  Efficient nearest neighbor searching for motion planning , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[65]  Jjd Joep Aerts.  Random redundant storage for video on demand , 2003 .

[66]  Mark de Berg,et al.  The Priority R-tree: a practically efficient and worst-case optimal R-tree , 2004, SIGMOD '04.

[67]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[68]  Dino Salvo Distefano,et al.  On model checking the dynamics of object-based software : a foundational approach , 2003 .

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

[70]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[71]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[72]  J. Matoussek.  Reporting points in halfspaces , 1991, FOCS 1991.

[73]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

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

[75]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[76]  Mario A. López,et al.  A greedy algorithm for bulk loading R-trees , 1998, GIS '98.

[77]  Joachim Gudmundsson,et al.  On R-trees with low query complexity , 2003, Comput. Geom..

[78]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[79]  F. Frances Yao,et al.  Efficient binary space partitions for hidden-surface removal and solid modeling , 1990, Discret. Comput. Geom..

[80]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[81]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

[82]  Jürg Nievergelt,et al.  Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects , 1993, Comput. J..