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
Maintenance of the set of segments visible from a moving viewpoint in two dimensions
Full text PdfPdf (205 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the twelfth annual symposium on Computational geometry table of contents
Philadelphia, Pennsylvania, United States
Pages: 503 - 504  
Year of Publication: 1996
ISBN:0-89791-804-5
Authors
Sherif Ghali  Department of Computer Science, University of Toronto
A. James Stewart  Department of Computer Science, University of Toronto
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): 2,   Downloads (12 Months): 13,   Citation Count: 2
Additional Information:

references   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/237218.237423
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.

 
BDEG90
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
 
GM87
Subir Kumar Ghosh , David M. Mount, An output-sensitive algorithm for computing visibility, SIAM Journal on Computing, v.20 n.5, p.888-910, Oct. 1991  [doi>10.1137/0220055]
MN95
Kurt Mehlhorn , Stefan Näher, LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, v.38 n.1, p.96-102, Jan. 1995  [doi>10.1145/204865.204889]
OvL80
Mark H. Overmars , Jan van Leeuwen, Dynamically maintaining configurations in the plane (Detailed Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.135-145, April 28-30, 1980, Los Angeles, California, United States  [doi>10.1145/800141.804661]
OW88
M. H. Overmars , E. Welzl, New methods for computing visibility graphs, Proceedings of the fourth annual symposium on Computational geometry, p.164-171, June 06-08, 1988, Urbana-Champaign, Illinois, United States  [doi>10.1145/73393.73410]
 
Poc90
M. Pocchiola, Graphics in Flatland revisited, Proceedings of the second Scandinavian workshop on Algorithm theory, p.85-96, July 1990, Bergen, Sweden

CITED BY  2
Timothy M. Chan, Dynamic planar convex hull operations in near-logarithmic amortized time, Journal of the ACM (JACM), v.48 n.1, p.1-12, Jan. 2001
Michael Hoffmann , Csaba D. Tóth, Segment endpoint visibility graphs are Hamiltonian, Computational Geometry: Theory and Applications, v.26 n.1, p.47-68, August 2003

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:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Graph algorithms


General Terms:
Algorithms

Collaborative Colleagues:
Sherif Ghali: colleagues
A. James Stewart: 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