Partitioning point sets in arbitrary dimension
- 1 January 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 49 (2-3) , 239-265
- https://doi.org/10.1016/0304-3975(87)90009-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Partitioning with two lines in the planeJournal of Algorithms, 1985
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Polygon RetrievalSIAM Journal on Computing, 1982