| Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions |
| Full text |
Pdf
(1.16 MB)
|
| Source
|
Annual Symposium on Computational Geometry
archive
Proceedings of the fifteenth annual symposium on Computational geometry
table of contents
Miami Beach, Florida, United States
Pages: 143 - 153
Year of Publication: 1999
ISBN:1-58113-068-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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 2
|
|
|
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
|
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.
|
| |
2
|
|
| |
3
|
P. K. Agarwal and M. Sharir, Arrangements and their applications, in Handbook of Computational Geometry (J. Sack, ed.), North-Holland, to appear.
|
| |
4
|
|
| |
5
|
|
| |
6
|
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.
|
| |
7
|
|
| |
8
|
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.
|
| |
13
|
|
| |
14
|
B. Tagansky, The Complexity of Substructures in Arrangements of Surfaces, Ph.D. Dissertation, Computer Science Department, Tel Aviv University, 1996.
|
CITED BY 2
|
|
Danny Z. Chen , Xiaobo Hu , Yingping Huang , Yifan Li , Jinhui Xu, Algorithms for congruent sphere packing and applications, Proceedings of the seventeenth annual symposium on Computational geometry, p.212-221, June 2001, Medford, Massachusetts, United States
|
|
|
|
|