Separating collections of points in Euclidean spaces

DOI10.1016/0020-0190(94)00186-3zbMath0875.68443OpenAlexW2042390260MaRDI QIDQ674178

Ralph P. Boland, Jorge Urrutia

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00186-3

zbMATH Keywords

AlgorithmsComputational geometryCombinatorial problemsInformation retrievalPoint setsSeparability

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20)

Related Items (4)

Identification of points using disks ⋮ Separating families of convex sets ⋮ Complexity and approximation for discriminating and identifying code problems in geometric setups ⋮ Discriminating Codes in Geometric Setups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-partitionable point sets
• Separating convex sets in the plane
• Algorithms for ham-sandwich cuts
• Cutting disjoint disks by straight lines
• Partitioning with two lines in the plane
• A seperation property of plane convex sets.
• Polygon Retrieval

This page was built for publication: Separating collections of points in Euclidean spaces