Motion planning of a ball amid segments in three dimensions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Motion planning of a ball amid segments in three dimensions

Full text

Pdf (1.07 MB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 21 - 30

Year of Publication: 1999

ISBN:0-89871-434-6

Authors

Pankaj K. Agarwal	Center for Geometric Computing, Department of Computer Science, Box 90129, Duke University, Durham, NC
Micha Sharir	School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel and Courant Institute of Mathematical Sciences, New York University, New York, NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

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	Pankaj K. Agarwal , Boris Aronov , Micha Sharir, Computing Envelopes in Four Dimensions with Applications, SIAM Journal on Computing, v.26 n.6, p.1714-1732, Dec. 1997 [doi>10.1137/S0097539794265724]
	2	P. K. Agarwal, B. Aronov, and M. Sharir, Motion planning for a convex polygon in a polygonal environment, to appear in Discrete Comput. Geom..
	3	P.K. Agarwal, O. Schwarzkopf and M. Sharir, The overlay of lower envelopes in 3-space and its applications, Discrete Comput. Geom. 15 (1996), 1-13.
	4	P.K. Agarwal and M. Shaxii, Arrangements and their applications, in Handbook of Computational Geometry (J. Sack, ed.), North-HoUand, to appear.
	5	Boris Aronov , Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , Micha Sharir , Rephael Wenger, Points and triangles in the plane and halving planes in space, Discrete & Computational Geometry, v.6 n.5, p.435-442, 1991
	6	Boris Aronov , Micha Sharir, On Translational Motion Planning of a Convex Polyhedron in 3-Space, SIAM Journal on Computing, v.26 n.6, p.1785-1803, Dec. 1997 [doi>10.1137/S0097539794266602]
	7	Boris Aronov , Micha Sharir , Boaz Tagansky, The Union of Convex Polyhedra in Three Dimensions, SIAM Journal on Computing, v.26 n.6, p.1670-1688, Dec. 1997 [doi>10.1137/S0097539793250755]
	8	J.D. Boissonnat, M. Sharir, B. Tagansky and M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral distance functions, Discrete Comput. Geom. 19 (1998), 485-519.
	9	Bernard Chazelle , Herbert Edelsbrunner , Leonidas J. Guibas , John E. Hershberger , Raimund Seidel , Micha Sharir, Selecting Heavily Covered Points, SIAM Journal on Computing, v.23 n.6, p.1138-1151, Dec. 1994 [doi>10.1137/S0097539790179919]
	10	Bernard Chazelle , Herbert Edelsbrunner , Leonidas Guibas , Micha Sharir , Jack Snoeyink, Computing a face in an arrangement of line segments and related problems, SIAM Journal on Computing, v.22 n.6, p.1286-1302, Dec. 1993 [doi>10.1137/0222077]
	11	L. Paul Chew , Klara Kedem , Micha Sharir , Boaz Tagansky , Emo Welzl, Voronoi diagrams of lines in 3-space under polyhedral convex distance functions, Journal of Algorithms, v.29 n.2, p.238-255, Nov. 1998 [doi>10.1006/jagm.1998.0957 ]
	12	Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
	13	Alon Efrat , Micha Sharir, On the complexity of the union of fat objects in the plane, Proceedings of the thirteenth annual symposium on Computational geometry, p.104-112, June 04-06, 1997, Nice, France [doi>10.1145/262839.262911]
	14	Klara Kedem , Ron Livne , János Pach , Micha Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete & Computational Geometry, v.1 n.1, p.59-71, 1986 [doi>10.1007/BF02187683]
	15	Jiri Matousek , Janos Pach , Micha Sharir , Shmuel Sifrony , Emo Welzl, Fat Triangles Determine Linearly Many Holes, SIAM Journal on Computing, v.23 n.1, p.154-169, Feb. 1994 [doi>10.1137/S009753979018330X]
	16	M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
	17	Micha Sharir , Pankaj K. Agarwal, Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, New York, NY, 1996
	18	B. Tagansky, The Complexity of Substructures in Arrangements of Surfaces, Ph.D. Dissertation, Computer Science Department, Tel Aviv University, 1996.