Cart (Loading....) | Create Account
Close category search window
 

Recent results in art galleries [geometry]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Shermer, T.C. ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

Two points in a polygon are called if the straight line between them lies entirely inside the polygon. The art gallery problem for a polygon P is to find a minimum set of points G in P such that every point in P is visible from some point of G. The author provides an introduction to art gallery theorems and surveys the recent results of the field. The emphasis is on the results rather than the techniques. Several new problems that have the same geometric flavor as art gallery problems are also examined

Published in:

Proceedings of the IEEE  (Volume:80 ,  Issue: 9 )

Date of Publication:

Sep 1992

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.