Separation Sensitive Kinetic Separation Structures for Convex Polygons-Reference-Cited by-同舟云学术

Separation Sensitive Kinetic Separation Structures for Convex Polygons

Published:2001 Issue: Volume: Page:222-236
ISSN:0302-9743
Container-title:Discrete and Computational Geometry
language:
Short-container-title:

Author:

Kirkpatrick David,Speckmann Bettina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47738-1_21

Reference19 articles.

1. P. K. Agarwal, J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger. Lower bounds for kinetic planar subdivisions. In Proc. 15th ACM Sympos. Comp. Geom., pages 247–254, 1999.

2. P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In Proc. 5th Workshop Algorithmic Found. Robotics, 2000.

3. J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang. Kinetic collision detection for two simple polygons. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 102–111, 1999.

4. J. Basch, L. Guibas, and J. Hershberger. Data structures for mobile data. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 747–756, 1997.

5. B. Chazelle and D. P. Dobkin. Intersection of convex objects in two and three dimensions. J. ACM, 34(1):1–27, Jan. 1987.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The stochastic walk algorithms for point location in pseudo-triangulations;Advances in Engineering Software;2011-08

2. Construction of Pseudo-triangulation by Incremental Insertion;Computational Science and Its Applications - ICCSA 2011;2011