Loading...
Search
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
Digital Object List
Bookmark
Review List
2064 viewed
شمارش ناحیه های قابل دید در صفحه
علیپور، شراره Alipour, Sharareh
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 42117 (02)
- University: Sharif University of Technology
- Department: Mathematical Sciences
- Advisor(s): Zarei, Alireza
- Abstract:
- Planar visibility computing is defined as determining the region of the plane that is visible from a specific observer. This concept has many applications in computer graphics, robotic and computer games. In this thesis we consider two visibility problems: the visibility testing problem which checks the inter-visibility of two objects and the visibility counting problem which counts the number of visible objects from an observer. For these problems we propose new algorithms which have some improvements compare to the previous ones
- Keywords:
- Computational Geometry ; Visibility Algorithm
محتواي پايان نامه