- Collection Overview
- Collection Description & Creator Information
- Access & Use
- Collection History
- Find Related Materials
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons, 1986
Collection Description & Creator Information
Consists of technical reports from the Department of Computer Science.
Access & Use
- Access Restrictions:
Collection is open for research use.
- Conditions for Reproduction and Use:
Single photocopies may be made for research purposes. For quotations that are fair use as defined under U. S. Copyright Law, no permission to cite or publish is required.
- Credit this material:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons; Department of Computer Science Technical Reports, ENG001, Technical and Scientific Reports, Engineering Library, Princeton University Library
- Engineering LibraryEngineering LibraryFriend Center for Engineering EducationPrinceton, NJ 08540, USA(609) email@example.com