Y. B. Karasik
ABSTRACT
Continuing our earlier study [12], we present optical algorithms for solving a variety of basic problems in computational geometry, each requiring only a constant number of basic optical operations. The main tools that we use are based on optical computational tricks that involve geometric duality and Minkowski sums of geometric figures.
- 1.R. Barakat and J. Reif, Lower bounds on the computational efficiency of optical computing systems, Applied Optics, 26(6), 1015-1018 (1987).Google Scholar
Cross Ref
- 2.R. Barakat and J. Reif, Polynomial convolution algorithm for matrix multiplication with application for optical computing, Applied Optics, 26(14), 2707-2711 (19s7).Google ScholarCross Ref
- 3.B. Chazelle, L. J. Guibas and D. T. Lee, The power of geometric duality, Proc. ~,ith IEEE Syrup. o/Foundation o} Computer Science, pp. 217-225, 1983.Google ScholarDigital Library
- 4.S.R. Deans, Hough Transform from the Radon Transform, IEEE Trans. Pattern Analysis and Machine In. telligence, PAMI-3 (2)(1981), 185-188.Google ScholarDigital Library
- 5.R.O. Duda and P.E. Hart, Use of the Hough transformation to detect lines and curves in pictures, Cornmun. ACM, 15(1) (1972), 11-15. Google ScholarDigital Library
- 6.V.M. Egorov and E.G. Kostov, Integrated optical digital computers, Applied Optics, 29(8), 1178-1185 (1990).Google ScholarCross Ref
- 7.L. Guibas, J. Hershberger, D. Leven, M. Sharir, R. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated polygons, Alflorithmica, 2(1987), pp. 209-233.Google ScholarDigital Library
- 8.A. Huang, Optical digital computing at Bell Labs, 1990 International Topical Meeting on Optical Computing, Kobe, Japan, 1990.Google Scholar
- 9.M. Iwata, J. Tanida and Y. Ichioka, Inference engine for expert system by using optical array logic, Applied Optics, 31(26), 5604-5613 (1992).Google ScholarCross Ref
- 10.Y. B. Karasik, Formalization of heuristic tacktics used by human beings in searching for the closest packing of arbitrary objects in a given domain, Cybernetics Systems: An International Journal, 20 (1), 1989, pp. 43-49. Google ScholarDigital Library
- 11.Y. B. Karasik, Optical algorithms of computational geometry, Technical report 199/91, The Eskenasy Institute of Computer Science, Tel Aviv University (1991).Google Scholar
- 12.Y. B. Karasik, M. Sharir, Optical computational geometry, Proc. 8th A CM Symposium on Computational Geometry, ACM Press, pp. 232-241, 1992. Google ScholarDigital Library
- 13.A.M. Karin and A. Awwal, Optical Computing: An Introduction, Wiley and Sons, New York, 1992. Google ScholarDigital Library
- 14.K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom. 1 (1986), 59-71. Google ScholarDigital Library
- 15.A. Louri, Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing, IEEE Micro, 24-81 (Apr. 1991). Google ScholarDigital Library
- 16.A.D. McAulay, Optical Computer Architecture, Wiley and Sons, New York, 1991. Google ScholarDigital Library
- 17.J.P. Pratt and V.P. Heuring, Designing digital optical computing systems: power and crosstalk, Applied Optics, 31(23), 4657-4661 (1992).Google ScholarCross Ref
- 18.J. Reif and A. Tyagi, Efficient parallel algorithms for optical computing with the D FT primitive, Proc. lOth Syrup. on Foundations of Software Technology and Theoretical Computer Science, 1990, Springer Lecture Notes in Computer Science 472, pp. 149-160. Google ScholarDigital Library
Index Terms
- The power of geometric duality and Minkowski sums in optical computational geometry
Recommendations
Maximal f-Vectors of Minkowski Sums of Large Numbers of Polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r
In this paper, we study sums of polytopes and prove a linear relation between the number of faces of a sum of r polytopes in dimension d, with rźd, and the number of faces in ...
Topological obstructions for vertex numbers of Minkowski sums
We show that for polytopes P"1,P"2,...,P"r@?R^d, each having n"i>=d+1 vertices, the Minkowski sum P"1+P"2+...+P"r cannot achieve the maximum of @?"in"i vertices if r>=d. This complements a recent result of Fukuda and Weibel (2006), who show that this is ...
Dynamic Minkowski sums under scaling
In many common real-world and virtual environments, there are a significant number of repeated objects, primarily varying in size. Similarly, in many complex machines, there are a significant number of parts which also vary in size rather than shape. ...
Comments