### 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 language | English (US) |
---|---|

Pages (from-to) | 118-123 |

Number of pages | 6 |

Journal | The Visual Computer |

Volume | 1 |

Issue number | 2 |

DOIs | |

State | Published - Aug 1 1985 |

### Fingerprint

### Keywords

- Algorithms
- Complexity
- Computational geometry
- Convex polygons
- Intersection

### ASJC Scopus subject areas

- Software
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design