The power of geometric duality and Minkowski sums in optical computational geometry

Authors:
Y. B. Karasik;M. Sharir
Affiliations:
-;-
Venue:
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Year:
1993

Citing 8
Cited 0

On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

Discrete & Computational Geometry
Formalization of heuristic tactics used by human beings in searching for the closest packing of arbitrary objects in a given domain

Cybernetics and Systems
Optical computer architectures: the application of optical concepts to next generation computers

Optical computer architectures: the application of optical concepts to next generation computers
Efficient parallel algorithms for optical computing with the DFT primitive

FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Optical computational geometry

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Use of the Hough transformation to detect lines and curves in pictures

Communications of the ACM
Optical Computing: An Introduction

Optical Computing: An Introduction
Three-Dimensional Optical Architecture and Data-Parallel Algorithms for Massively Parallel Computing

IEEE Micro

Quantified Score

Hi-index	0.00

Visualization

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.