Partitioning point sets in arbitrary dimension

DOI10.1016/0304-3975(87)90009-0zbMath0612.68089OpenAlexW4210598211MaRDI QIDQ1088420

Richard John Cole

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90009-0

zbMATH Keywords

searchingefficient algorithmsdata structure for the half-space retrieval problemparallel planes partitionsublinear query time

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Partitioning with two lines in the plane
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On k-Hulls and Related Problems
• Polygon Retrieval
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Partitioning point sets in arbitrary dimension