𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A counter-example to a convex hull algorithm for polygons

✍ Scribed by Godfried Toussaint

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
161 KB
Volume
24
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A counter example for the conjecture in
A counter example for the conjecture in β€˜an algorithm for interpolation with units in Hβˆžβ€™
✍ Vijay V. Patel; K.B. Datta πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 93 KB

## It is conjectured by Dorato et al. [Automatica, 25, 427-430 (1989) ], that the algorithm given by them for interpolation with units in H,, gives the lowest possible degree unit. A counter example presented in this technical communication shows that this is not the case for real as well as comp