ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Efficient ray shooting and hidden surface removal
Source Annual Symposium on Computational Geometry archive
Proceedings of the seventh annual symposium on Computational geometry table of contents
North Conway, New Hampshire, United States
Pages: 21 - 30  
Year of Publication: 1991
ISBN:0-89791-426-0
Authors
M. de Berg
D. Halperin
M. Overmars
J. Snoeyink
M. van Kreveld
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): n/a,   Downloads (12 Months): n/a,   Citation Count: 8
Additional Information:

cited by   index terms   collaborative colleagues  

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/109648.109651
What is a DOI?

CITED BY  8
Leila De Floriani , Paola Magillo, Algorithms for visibility computation on digital terrain models, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.380-387, February 14-16, 1993, Indianapolis, Indiana, United States
Mark de Berg, Generalized hidden surface removal, Proceedings of the ninth annual symposium on Computational geometry, p.1-10, May 18-21, 1993, San Diego, California, United States
Pankaj K. Agarwal , Jiří Matoušek, Ray shooting and parametric search, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.517-526, May 04-06, 1992, Victoria, British Columbia, Canada
Mark de Berg , Mark Overmars , Otfried Schwarzkopf, Computing and verifying depth orders, Proceedings of the eighth annual symposium on Computational geometry, p.138-145, June 10-12, 1992, Berlin, Germany
 
Pankaj K. Agarwal , Micha Sharir, Ray shooting amidst convex polytopes in three dimensions, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.260-270, January 25-27, 1993, Austin, Texas, United States
Marco Pellegrini, On lines missing polyhedral sets in 3-space, Proceedings of the ninth annual symposium on Computational geometry, p.19-28, May 18-21, 1993, San Diego, California, United States
Marco Pellegrini, Incidence and nearest-neighbor problems for lines in 3-space, Proceedings of the eighth annual symposium on Computational geometry, p.130-137, June 10-12, 1992, Berlin, Germany
 
Danny Z. Chen, On the all-pairs Euclidean short path problem, Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, p.292-301, January 22-24, 1995, San Francisco, California, United States

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.7 Three-Dimensional Graphics and Realism
          Subjects: Raytracing; Visible line/surface algorithms


General Terms:
Algorithms, Verification

Collaborative Colleagues:
M. de Berg: colleagues
D. Halperin: colleagues
M. Overmars: colleagues
J. Snoeyink: colleagues
M. van Kreveld: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player