Efficient dynamic programming using quadrangle inequalities
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
New techniques for computing order statistics in Euclidean space (extended abstract)
SCG '85 Proceedings of the first annual symposium on Computational geometry
Minimal Ellipsoids and Maximal Simplexes in 3D Euclidean Space
Cybernetics and Systems Analysis
Hand-Drawn Shape Recognition Using the SVM'ed Kernel
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Efficient lattice width computation in arbitrary dimension
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Recognition of largest empty orthoconvex polygon in a point set
Information Processing Letters
Computing efficiently the lattice width in any dimension
Theoretical Computer Science
| Hi-index | 0.00 |
Given n points in the plane, we present algorithms for finding maximum perimeter or area convex k-gons with vertices k of the given n points. Our algorithms work in linear space and time O(knlg n + n lg 2n). For the special case k -&-equil; 3 we give O (nlgn) algorithms for these problems. Several related issues are discussed.