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

An Algorithm for In-Line Generation of a Convex Cover

โœ Scribed by Denis Rutovitz

Publisher
Elsevier Science
Year
1975
Weight
171 KB
Volume
4
Category
Article
ISSN
0146-664X

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

An algorithm for planning jointing of li
An algorithm for planning jointing of lines in an optical distribution network
โœ Masayuki Tsujino ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 600 KB

A method of determining the most effective way to joint lines in an optical distribution network is needed, because of the high cost of jointing optical-fiber lines compared to lines in a metallic network and because of the limitation on the number of joints. In this paper, I model the joint form pl