Power of geometric duality and Minkowski sums in optical computational geometry

Y. B. Karasik*, M. Sharir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Continuing our earlier study [12]2, 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.

Original languageEnglish
Title of host publicationProceedings of the 9th Annual Symposium on Computational Geometry
PublisherAssociation for Computing Machinery (ACM)
Pages379-388
Number of pages10
ISBN (Print)0897915828, 9780897915823
DOIs
StatePublished - 1993
EventProceedings of the 9th Annual Symposium on Computational Geometry - San Diego, CA, USA
Duration: 19 May 199321 May 1993

Publication series

NameProceedings of the 9th Annual Symposium on Computational Geometry

Conference

ConferenceProceedings of the 9th Annual Symposium on Computational Geometry
CitySan Diego, CA, USA
Period19/05/9321/05/93

Fingerprint

Dive into the research topics of 'Power of geometric duality and Minkowski sums in optical computational geometry'. Together they form a unique fingerprint.

Cite this