Loading...
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 50172 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Abam, Mohammad Ali
- Abstract:
- In this thesis, we investigate some problems in Sublinear field. We designed an algorithm that approximate the minimum distance of a shape to be a disk. In the first algorithm, we assumed that its input is a matrix and 1s in the matrix represent black pixels and 0s in the matrix represent white pixels. Also, we designed another algorithm that its input is a data structure contains the positions of a convex shape and we can sample uniformly from its pixels. In this problem similar to the first problem we must approximate the minimum distance of a shape to be a disk. Finally, we designed an algorithm for counting disks in a matrix. The input is a matrix that it contains some disks which have the same radius. In the algorithm, we approximate the number of disks
- Keywords:
- Computational Geometry ; Randomized Algorithm ; Property Testing ; SubLine Algorithms ; Diskable Property
-
محتواي کتاب
- view