ACM Home Page
Please provide us with feedback. Feedback
The complexity of the union of (&agr;, &bgr;)-covered objects
Full text PdfPdf (784 KB)
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: 134 - 142  
Year of Publication: 1999
ISBN:1-58113-068-6
Author
Alon Efrat  Computer Science Department, Stanford 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): 3,   Downloads (12 Months): 9,   Citation Count: 7
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/304893.304958
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
 
2
 
3
B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Algorithms for bichromatic line segment problems and polyhedral terrains, Algorithmica 11 (1994), 116-132.
4
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
J. Pach and M. Sharir, On the boundary of the union of planar convex sets, to appear in Discrete Comput. Geom.
 
14
 
15
F. van der Stappen, Motion Planning amidst Fat Obstacles, Ph.D. Dissertation, Utrecht University, 1994.



Peer to Peer - Readers of this Article have also read: