Iterated nearest neighbors and finding minimal polytopes
- 1 March 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 11 (3) , 321-350
- https://doi.org/10.1007/bf02574012
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- On vertical ray shooting in arrangementsComputational Geometry, 1993
- New Upper Bounds in Klee’s Measure ProblemSIAM Journal on Computing, 1991
- Finding k points with minimum diameter and related problemsJournal of Algorithms, 1991
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Sets with No Empty Convex 7-GonsCanadian Mathematical Bulletin, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980