Partitioning point sets in arbitrary dimension

DOI10.1016/0304-3975(87)90009-0MaRDI QIDQ1088420zbMATH OpenOpenAlexFDO

Authors Richard 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

efficient algorithmssearchingdata structure for the half-space retrieval problemparallel planes partitionsublinear query time

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3911765
• Partitioning points by parallel planes
• Efficient partition trees
• Non-partitionable point sets
• scientific article; zbMATH DE number 4213488

Cites work

• scientific article; zbMATH DE number 3911765 (Why is no real title available?)
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On k-Hulls and Related Problems
• Partitioning with two lines in the plane
• Polygon Retrieval
• Slowing down sorting networks to obtain faster sorting algorithms

Cited in

(10)

• Dispersing and grouping points on planar segments
• Storing line segments in partition trees
• Partitioning points by parallel planes
• Problem of partitioning a planar point set into empty convex polygons
• Non-partitionable point sets
• The power of parallel projection
• scientific article; zbMATH DE number 3911765 (Why is no real title available?)
• Partitioning Space for Range Queries
• Partitioning axis-parallel lines in 3D
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1088420)