Efficient generation of k-directional assembly sequences

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 122-131

  Agarwal, Pankaj K ^a   De Berg, Mark ^b   Halperin, Dan ^c   Sharir, Micha ^d,e  

^a Duke University   (United States)

^b UTRECHT UNIVERSITY   (Netherlands)

^c Stanford University   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ASSEMBLY SEQUENCE; LINEAR ORDER; RIGID BODY; ROTATIONAL MOTION;

GEOMETRY;

EID: 0002740435     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. Agarwal, M.J. Katz, and M. Sharir, Computing depth orders and related problems, Proc. 4th Scandinavian Workshop on Algorithm Theory, Denmark, 1994, pp.1-12. Also, to appear in Comput. Geom. Theory Appls.
2. P. Agarwal and J. Matousek, Ray shooting and parametric search, SIAM J. Comput. 22 (1993), 794-806.
3. P. Agarwal and J. Matousek, Dynamic half-space range searching and its applications, Algorithmica 13 (1995), 325-345.
4. P. Agarwal and M. Sharir, Applications of a new space partitioning scheme. Discrete Comput. Geom. 9 (1993), 11-38.
5. M. de Berg, Ray Shooting, Depth Orders and Hidden Surface Removal, Lecture Notes in Computer Science, Vol. 703, Springer-Verlag, Berlin, 1993.
6. M. de Berg, M. Overmars and O. Schwarzkopf, Computing and verifying depth orders, SIAM J. Comput. 23 (1994), 437-446.
7. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Stolfi. Lines in space: Combinatorics and algorithms. Proc. 21st ACM Symp. on Theory of Computing, 1989, pp. 382-393.
8. F. Dehne and J.-R. Sack, Translation separability of sets of polygons, Visual Computer 3 (1987), 227-235.
9. J. García-López and P. Ramos-Alonzo, Circular visibility and separability, Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 18-23.
10. L.J. Guibas, D. Halperin, H. Hirukawa, J.-C. Latombe and R.H. Wilson, A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions, Proc. IEEE International Conference on Robotics and Automation, 1995, pp. 2553-2560.
11. L. S. Hornern de Mello and S. Lee, editors, Computer-Aided Mechanical Assembly Planning, Kluwer Academic Publishers, Boston, 1991.
12. J. Matousek, Reporting points in half-spaces, Comput. Geom. Theory Appls. 2 (1992), 169-186.
13. J. Matousek, Geometric range searching, ACM Computing Surveys 26 (1994), 421-461.
14. E. Schemer and C. Thiel, Efficient collision detection for moving polyhedra, Proc. 11th ACM Symp. on Computational Geometry, 1995, pp. 51-60.
15. C. Thiel, personal communication.
16. G.T. Toussaint, Movable separability of sets, in Computational Geometry (G.T. Toussaint, editor), North-Holland, Amsterdam, 1985, pp. 335-375.
17. R. H. Wilson, On Geometric Assembly Planning, Ph.D. Dissertation, Computer Science Department, Stanford University, March 1992.
18. R. H. Wilson and J.-C. Latombe, Geometric reasoning about mechanical assembly, Artificial Intelligence 71 (1994), 371-396.
19. R. H. Wilson and T. Matsui, Partitioning an assembly for infinitesimal motions in translation and rotation, Proceedings of the IEEE International Conference on Intelligent Robots and Systems (1992), pp. 1311-1318.