A package for exact kinetic data structures and sweepline algorithms

Computational Geometry: Theory and Applications

Volumn 38, Issue 1-2, 2007, Pages 111-127

  Russel, Daniel ^a   Karavelas, Menelaos I ^b,c   Guibas, Leonidas J ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF CRETE   (Greece)

^c INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867922181     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2006.11.006     Document Type: Article

References (17)

1. J. Basch, L. Guibas, J. Hershberger, Data structures for mobile data, in: SODA '97: Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 747-756
2. J. Basch, L.J. Guibas, C.D. Silverstein, and L. Zhang A practical evaluation of kinetic data structures SCG '97: Proceedings of the Thirteenth Annual ACM Symposium on Computational Geometry 1997 ACM Press New York 388 390
3. J. Basch, L. Guibas, C. Silverstein, L. Zhang, The demokin library, 1997, http://julien.b3h.org/demokin/demokin.html
4. L.J. Guibas, M.I. Karavelas, Interval methods for kinetic simulations, in: SCG '99: Proceedings of the Fifteenth Annual ACM Symposium on Computational Geometry, 1999, pp. 255-264
5. D. Kirkpatrick, J. Snoeyink, and B. Speckmann Kinetic collision detection for simple polygons International Journal of Computational Geometry and Applications 12 1-2 2002 3 27 http://www.win.tue.nl~speckman/demos/kcdsp/
6. V. Karamcheti, C. Li, I. Pechtchanski, and C. Yap A CORE library for robust numeric and geometric computation in: SCG '99: Proceedings of the Fifteenth Annual ACM Symposium on Computational Geometry, 1999, pp. 351-359 http://www.cs.nyu.edu/exact/core/
7. C. Burnikel, K. Mehlhorn, and S. Schirra The LEDA class real number Tech. Rep. MPI-I-96-1-001, MPI für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany, 1996 http://www.mpi-sb.mpg.de/LEDA/
8. K. Mehlhorn, and S. Näher LEDA: A Platform for Combinatorial and Geometric Computing 2000 Cambridge University Press Cambridge, UK
9. The Qt library, http://www.trolltech.com/products/qt
10. The Coin library, http://www.coin3d.org
11. D.W. Jones An empirical comparison of priority-queue and event-set implementations Communications of the ACM 29 4 1986 300 311
12. The upper-bound algorithm, Standard Template Library (STL), http://www.sgi.com/tech/stl/upper-bound.html
13. E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, L. Kettner, K. Mehlhorn, J. Reichel, S. Schmitt, E. Schömer, N. Wolpert, EXACUS: Efficient and Exact Algorithms for Curves and Surfaces, in: Proceedings of the Thirteenth Annual European Symposium on Algorithms, 2005, pp. 155-166
14. V. Milenkovic, E. Sacks, An approximate arrangement algorithm for semi-algebraic curves, in: SCG '06: Proceedings of the Twenty-Second Annual ACM Symposium on Computational Geometry, 2006, pp. 237-246
15. L. Guibas, and D. Russel An empirical comparison of techniques for updating Delaunay triangulations SCG '04: Proceedings of the Twentieth Annual ACM Symposium on Computational Geometry 2004 ACM Press New York 170 179
16. D. Salesin, J. Stolfi, and L. Guibas Epsilon geometry: building robust algorithms from imprecise computations SCG '89: Proceedings of the Fifth Annual ACM Symposium on Computational Geometry 1989 ACM Press New York 208 217
17. R. Shewchuk Star splaying: an algorithm for repairing Delaunay triangulations and convex hulls SCG '05: Proceedings of the Twenty-First Annual ACM Symposium on Computational Geometry 2005 ACM Press New York 237 246