d1-optimal motion for a rod (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

d1-optimal motion for a rod (extended abstract)

Full text

Pdf (1.14 MB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the twelfth annual symposium on Computational geometry table of contents

Philadelphia, Pennsylvania, United States

Pages: 252 - 263

Year of Publication: 1996

ISBN:0-89791-804-5

Authors

Tetsuo Asano	Osaka Electro-Communication University, Japan
David Kirkpatrick	University of British Columbia, Canada
Chee K. Yap	Courant Institute, New York University

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237218.237394 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. S. Besicovitch. On Kakeya's problem and a similar one. Mathematische Z~~tschrifi, 27:312-320, 1928.
	2	J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. IEEE Foundations of Computer Science, 28:49-60, 1987.
	3	Joonsoo Choi , Jürgen Sellen , Chee-Keng Yap, Approximate Euclidean shortest path in 3-space, Proceedings of the tenth annual symposium on Computational geometry, p.41-48, June 06-08, 1994, Stony Brook, New York, United States [doi>10.1145/177424.177501]
	4	C. Icking, G. Rote, E. Welzl, and C. Yap. Shortest paths for line segments. Algorithmica, 10:182-200, 1993.
	5	J. O'Rourke. Finding a shortest ladder path: a special case. IMA Preprint Series 353, Institute for Mathematics and its Applications, University of Minnesota, 1987.
	6	C. H. Papadimitriou and E. B. Silverberg. Optimal piecewise linear motion of an object among obstacles. Algorithmica, 2:523-539, 1987.
	7	J. H. Reif, J. D. Tygar, and A. Yoshida. Computability and complexity of ray tracing. Discrete Comput. Geom., 11:265-287, 1994.
	8	J. T. Schwartz and M. Sharir. On the piano movers' problem: I. the case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Communications on Pure and Applied Mathematics, 36:345-398, 1983.
	9	M. Sharir. A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder. NYU Robotics Report 188, Courant Institute, New York University, 1989.
	10	M. Sharir, C. O'D'finlaing, and C. Yap. Generalized Voronoi diagrams for moving a ladder I: topological analysis. Communications in Pure and Applied Math., XXXIX:423-483, 1986.
	11	M. Sharir, C. O'D'finlaing, and C. Yap. Generalized Voronoi diagrams for moving a ladder II: efficient computation of the diagram. Algorithmica, 2:27-59, 1987.
	12	S. M. Ulam. Problems of Modern Mathematics. Science Editions, New York, 1964. Originally published as: A Collection of Mathematical Problems, Interscience Publishers, New York, 1960.
	13	Chee Yap. Algorithmic motion planning. In J. T. Schwartz and C. K. Yap, editors, Advances in Robotics, Vol. 1: Algorithmic and geometric issues, chapter 3. Lawrence Erlbaum Associates, 1987.