Hidden surface removal with respect to a moving view point

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Hidden surface removal with respect to a moving view point

Full text

Pdf (1.28 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-third annual ACM symposium on Theory of computing table of contents

New Orleans, Louisiana, United States

Pages: 512 - 522

Year of Publication: 1991

ISBN:0-89791-397-3

Author

Ketan Mulmuley

The Univ. of Chicago, Chicago, IL

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 14, Citation Count: 8

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/103418.103471 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	Bentley J.L., Ottmann Th., Algorithms for reporting and counting geometric intersections, IEEE trans, on computers C28, 643-6#7.
	2	Berg M., Overmars M., Hidden surface removal for axis-parallel polyhedra, Proceedings o.f the FOCS, 90.
	3	M. Bern, Hidden surface removal for rectangles, Proceedings of the fourth annual symposium on Computational geometry, p.183-192, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73412]
	4	Marshall Bern , David Dobkin , David Eppstein , Robert Grossman, Visibility with a moving point of view, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.107-117, January 22-24, 1990, San Francisco, California, United States
	5	Cheng S., Janardan R., New results on dynamic point location, Proceeddings of the Symposium on Theory of Computing, 1990, pp. 96-I05.
	6	Clarkson K., Edelsbrunner H., Guibas L., Sharir M., Welzl E., Combinatorial complexity bounds for arrangements of curves and surfaces, Proceedings o} the 29th FOCS, 1988.
	7	Henry Fuchs , Zvi M. Kedem , Bruce F. Naylor, On visible surface generation by a priori tree structures, ACM SIGGRAPH Computer Graphics, v.14 n.3, p.124-133, July 1980
	8	S Hart , M Sharir, Nonlinearity of Daveport:80Schinzel sequences and of generalized path compression schemes, Combinatorica, v.6 n.2, p.151-177, 1986 [doi>10.1007/BF02579170]
	9	K. Mulmuley, An efficient algorithm for hidden surface removal, Proceedings of the 16th annual conference on Computer graphics and interactive techniques, p.379-388, July 1989
	10	K. Mulmuley, "An efficient algorithm for hidden surface removal, II", To appear in the special issue of the Journal of Alg. on FOCS 1990.
	11	Mulmuley K., Forthcoming paper (in preparation).
	12	Mulmuley K., A fast planar partition algorithm, I, Proceedings of the 29th the FOCS, 1988.
	13	K. Mulmuley, Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.322-330, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100259]
	14	M. S. Paterson , F. F. Yao, Binary partitions with applications to hidden surface removal and solid modelling, Proceedings of the fifth annual symposium on Computational geometry, p.23-32, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73836]
	15	J. H. Reif , S. Sen, An efficient output-sensitive hidden surface removal algorithm and its parallelization, Proceedings of the fourth annual symposium on Computational geometry, p.193-200, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73413]
	16	Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986 [doi>10.1145/6138.6151]
	17	R Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.404-413, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12172]
	18	M. Sharir, Almost linear upper bounds on the length of general Davenport-Schinzel sequences, Combinatorica, v.7 n.1, p.131-143, Jan. 1987 [doi>10.1007/BF02579209]
	19	Ivan E. Sutherland , Robert F. Sproull , Robert A. Schumacker, A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys (CSUR), v.6 n.1, p.1-55, March 1974 [doi>10.1145/356625.356626]
	20	William C. Thibault , Bruce F. Naylor, Set operations on polyhedra using binary space partitioning trees, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.153-162, July 1987

CITED BY 8

	M. Pellegrini, Monte Carlo approximation of form factors with error bounded a priori, Proceedings of the eleventh annual symposium on Computational geometry, p.287-296, June 05-07, 1995, Vancouver, British Columbia, Canada
	Satyan Coorg , Seth Teller, Temporally coherent conservative visibility (extended abstract), Proceedings of the twelfth annual symposium on Computational geometry, p.78-87, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	Alon Efrat , Leonidas J. Guibas , Olaf A. Hall-Holt , Li Zhang, On incremental rendering of silhouette maps of polyhedral scene, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.910-917, January 09-11, 2000, San Francisco, California, United States
	Marc de Berg , Leonidas J. Guibas , Dan Halperin, Vertical decompositions for triangles in 3-space, Proceedings of the tenth annual symposium on Computational geometry, p.1-10, June 06-08, 1994, Stony Brook, New York, United States
	Bernard Chazelle, Computational geometry: a retrospective, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.75-94, May 23-25, 1994, Montreal, Quebec, Canada
	Marco Pellegrini, On point location and motion planning among simplices, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.95-104, May 23-25, 1994, Montreal, Quebec, Canada
	Frédo Durand , George Drettakis , Claude Puech, The 3D visibility complex, ACM Transactions on Graphics (TOG), v.21 n.2, p.176-206, April 2002
	Alon Efrat , Leonidas J. Guibas , Olaf A. Hall-Holt , Li Zhang, On incremental rendering of silhouette maps of a polyhedral scene, Computational Geometry: Theory and Applications, v.38 n.3, p.129-138, October, 2007