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

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

โœ Scribed by Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
224 KB
Volume
20
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 plane by combining the ลฝ ลฝ . ลฝ . prune-and-search strategy of Megiddo

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for optimizing th
An efficient algorithm for optimizing the electrical performance of HBTs
โœ Hyungkeun Ahn; M. El-Nokali; Deuk-Young Han ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

## Abstract A physical model for AlGaAs/GaAs heterojunction bipolar transistor with different emitter and base structures is proposed. The recombination currents in various depletion regions of the device are derived and are used to calculate the collector current in the range of 300โ€“600 K. The the

A Fast Algorithm for the Optimal Alignme
A Fast Algorithm for the Optimal Alignment of Three Strings
โœ Lloyd Allison ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg