๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple linear algorithm for intersecting convex polygons

โœ Scribed by Godfried T. Toussaint

Publisher
Springer
Year
1985
Tongue
English
Weight
456 KB
Volume
1
Category
Article
ISSN
0178-2789

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved algorithm for intersecting c
An improved algorithm for intersecting convex polygons
โœ Youssef G. Saab ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 200 KB

A modification of a linear-time algorithm to compute the intersection of two convex polygons reduces the number of computational steps by almost half. @ 1997 Elsevier Science B.V.

A linear-time near-optimum-length triang
A linear-time near-optimum-length triangulation algorithm for convex polygons
โœ Vitit Kantabutra ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 400 KB

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.