On fence design and the complexity of push plans for orienting parts

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Robert-Paul Berretty Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
Ken Goldberg Industrial Engineering and Operations Research, University of California at Berkeley, Berkeley, CA
Mark H. Overmars Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
A. Frank van der Stappen Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
On fence design and the complexity of push plans for orienting parts Published by ACM 1997 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 213
· Citation Count: 4

Published in:
Cover Image
 
· Proceeding
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Pages 21-29
ACM New York, NY, USA ©1997
table of contents ISBN:0-89791-878-9 doi>10.1145/262839.262853

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder