𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimally Decomposing Coverings with Translates of a Convex Polygon

✍ Scribed by Matt Gibson; Kasturi Varadarajan

Publisher
Springer
Year
2011
Tongue
English
Weight
874 KB
Volume
46
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A nearly optimal parallel algorithm for
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
✍ Piotr Berman; Andrzej Lingas πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 756 KB

We present a parallel algorithm for the Voronoi diagram of the set of vertices of a convex polygon. The algorithm runs in time O(logn) and uses O(n loglogn/log n) processors in the CRCW PRAM model. The concurrent write is used only by an integer sorting subroutine. We also obtain an O(log n)-time an

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the