On the union of κ-curved objects

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the union of κ-curved objects

Full text

Pdf (970 KB)

Source

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

Minneapolis, Minnesota, United States

Pages: 206 - 213

Year of Publication: 1998

ISBN:0-89791-973-4

Authors

Alon Efrat	Department of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel
Matthew J. Katz	Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer-Sheva S4105, Israel

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): 0, Downloads (12 Months): 4, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/276884.276908 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	Pankaj K. Agarwal , Matthew J. Katz , Micha Sharir, Computing depth orders for fat objects and related problems, Computational Geometry: Theory and Applications, v.5 n.4, p.187-206, Nov. 1995 [doi>10.1016/0925-7721(95)00005-8]
	2	t/. Alt, R. F/eischer, M. Kaufmann, K. Mehlhorn, S. N#iher, S. Schirra and C. Uhrig, Approximate motion planning and the complexity of the boundary of the union of simple geometric figures, Algorilhmica 8 (1992), 391-406.
	3	Mark de Berg, Linear Size Binary Space Partitions for Fat Objects, Proceedings of the Third Annual European Symposium on Algorithms, p.252-263, September 25-27, 1995
	4	B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Algorithms for bichromatic line segment problems and polyhedral terrains, Algorithmica 11 (1994), 116-132.
	5	Alon Efrat , Matthew J. Katz , Frank Nielsen , Micha Sharir, Dynamic Data Structures for Fat Objects and Their Applications, Proceedings of the 5th International Workshop on Algorithms and Data Structures, p.297-306, August 06-08, 1997
	6	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]
	7	Matthew J. Kaltz, 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects, Computational Geometry: Theory and Applications, v.8 n.6, p.299-316, Nov. 1997 [doi>10.1016/S0925-7721(96)00027-2]
	8	Matthew J. Katz , Mark H. Overmars , Micha Sharir, Efficient hidden surface removal for objects with small union size, Computational Geometry: Theory and Applications, v.2 n.4, p.223-234, Dec. 1992 [doi>10.1016/0925-7721(92)90024-M]
	9	Marc J. van Kreveld, On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract), Proceedings of the Third Workshop on Algorithms and Data Structures, p.452-463, August 11-13, 1993
	10	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]
	11	Mark H. Overmars , A. Frank van der Stappen, Range searching and point location among fat objects, Journal of Algorithms, v.21 n.3, p.629-656, Nov. 1996 [doi>10.1006/jagm.1996.0063]
	12	Micha Sharir , Pankaj K. Agarwal, Davenport-Schinzel sequences and their geometric applications, Cambridge University Press, New York, NY, 1996
	13	F. van der Stappen, Molion planning amidsl fat obstacles, Ph.D. Dissertation, Utrecht University, 1994.
	14	J. Vleugels, On falness and fitness -- realistic inpu# models for geometric algorithms, Ph.D. Dissertation, Utrecht University, 1997.

CITED BY 3

	Alon Efrat, The complexity of the union of (&agr;, &bgr;)-covered objects, Proceedings of the fifteenth annual symposium on Computational geometry, p.134-142, June 13-16, 1999, Miami Beach, Florida, United States
	J. Pach , Ido Safruti , Micha Sharir, The union of congruent cubes in three dimensions, Proceedings of the seventeenth annual symposium on Computational geometry, p.19-28, June 2001, Medford, Massachusetts, United States
	Mark de Berg, Vertical ray shooting for fat objects, Proceedings of the twenty-first annual symposium on Computational geometry, June 06-08, 2005, Pisa, Italy