A simple linear algorithm for intersecting convex polygons

Research output: Contribution to journalArticle

Abstract

Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.

Original languageEnglish (US)
Pages (from-to)118-123
Number of pages6
JournalThe Visual Computer
Volume1
Issue number4
DOIs
StatePublished - Dec 1 1985

Fingerprint

Triangulation

Keywords

  • Algorithms
  • Complexity
  • Computational geometry
  • Convex polygons
  • Intersection

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

A simple linear algorithm for intersecting convex polygons. / Toussaint, Godfried.

In: The Visual Computer, Vol. 1, No. 4, 01.12.1985, p. 118-123.

Research output: Contribution to journalArticle

@article{bfa9cd88b80846f69426809b666b3fe2,
title = "A simple linear algorithm for intersecting convex polygons",
abstract = "Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.",
keywords = "Algorithms, Complexity, Computational geometry, Convex polygons, Intersection",
author = "Godfried Toussaint",
year = "1985",
month = "12",
day = "1",
doi = "10.1007/BF01898355",
language = "English (US)",
volume = "1",
pages = "118--123",
journal = "Visual Computer",
issn = "0178-2789",
publisher = "Springer Verlag",
number = "4",

}

TY - JOUR

T1 - A simple linear algorithm for intersecting convex polygons

AU - Toussaint, Godfried

PY - 1985/12/1

Y1 - 1985/12/1

N2 - Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.

AB - Let P and Q be two convex polygons with m and n vertices, respectively, which are specified by their cartesian coordinates in order. A simple O(m+n) algorithm is presented for computing the intersection of P and Q. Unlike previous algorithms, the new algorithm consists of a two-step combination of two simple algorithms for finding convex hulls and triangulations of polygons.

KW - Algorithms

KW - Complexity

KW - Computational geometry

KW - Convex polygons

KW - Intersection

UR - http://www.scopus.com/inward/record.url?scp=34250110935&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250110935&partnerID=8YFLogxK

U2 - 10.1007/BF01898355

DO - 10.1007/BF01898355

M3 - Article

VL - 1

SP - 118

EP - 123

JO - Visual Computer

JF - Visual Computer

SN - 0178-2789

IS - 4

ER -