An Algorithm to Find the Intersection of Two Convex Polygons

Abstract

An algorithm is given that finds the intersection of two convex polygons. It is coded in Fortran for the IBM PC desktop computer. The program is robust and fast. It has been used successfully in targeting applications that require a rapid determination of the common intersection of more than 100 convex polygons, each specified by more than 150 vertices.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1993
Accession Number
ADA274722

Entities

People

  • Armido R. Didonato

Organizations

  • Naval Surface Warfare Center

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Boundaries
  • Cartesian Coordinates
  • Classification
  • Computer Graphics
  • Computers
  • Contracts
  • Monitoring
  • Naval Operations
  • Naval Warfare
  • Polygons
  • Procedures (Computers)
  • Space Systems
  • Surface Warfare
  • Targeting

Readers

  • Computer Vision.
  • Operations Research