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
โฆ LIBER โฆ
An analytical algorithm for determining the generalized optimal set of discriminant vectors
โ Scribed by Wu Xiao-Jun; Josef Kittler; Yang Jing-Yu; Wang Shi-Tong
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 130 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
An Optimal Algorithm for the Intersectio
โ
Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 224 KB
An algorithm for the determination of th
โ
A. Locatelli; S. Rinaldi
๐
Article
๐
1970
๐
Elsevier Science
๐
English
โ 574 KB
Optimal periodic processes with given initial conditions are here considered from a computational point of view. A search plan for the frequency of the periodic process is derived according to a min-max criterion. SnmmRry--The paper deals with the problem of optimization of periodic processes with
An Algorithm for the Determination of th
โ
K. Engel
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 273 KB
An algorithm for determining the minimal
โ
J.B. Hughes
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 467 KB
An explicit level set approach for gener
โ
Sebastian Kreissl; Georg Pingen; Kurt Maute
๐
Article
๐
2011
๐
John Wiley and Sons
๐
English
โ 800 KB
The auxiliary principle and an algorithm
โ
Xie Ping Ding; Zhong Bao Wang
๐
Article
๐
2010
๐
Elsevier Science
๐
English
โ 580 KB