𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Searching for empty convex polygons

✍ Scribed by David P. Dobkin; Herbert Edelsbrunner; Mark H. Overmars

Publisher
Springer
Year
1990
Tongue
English
Weight
616 KB
Volume
5
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Empty convex polygons in almost convex s
Empty convex polygons in almost convex sets
✍ Pavel Valtr; GΓ‘bor Lippner; Gyula KΓ‘rolyi πŸ“‚ Article πŸ“… 2007 πŸ› Springer Netherlands 🌐 English βš– 139 KB
Extremal problems for convex polygons
Extremal problems for convex polygons
✍ Charles Audet; Pierre Hansen; FrΓ©dΓ©ric Messine πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 501 KB
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.