Separating collections of points in Euclidean spaces

DOI10.1016/0020-0190(94)00186-3zbMATH Open0875.68443OpenAlexW2042390260MaRDI QIDQ674178FDOQ674178

Authors: Ralph P. Boland, J. 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

Recommendations

• Separating families of convex sets
• Separation of convex sets
• On the complexity of polyhedral separability
• scientific article

zbMATH Keywords

AlgorithmsComputational geometryCombinatorial problemsInformation retrievalPoint setsSeparability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-partitionable point sets
• Algorithms for ham-sandwich cuts
• Polygon Retrieval
• Title not available (Why is that?)
• Partitioning with two lines in the plane
• Separating convex sets in the plane
• Cutting disjoint disks by straight lines
• A seperation property of plane convex sets.

Cited In (18)

• Discriminating Codes in Geometric Setups
• Separation of convex sets
• Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes
• Identification of points using disks
• Separating pairs of points of standard boxes
• On the complexity of polyhedral separability
• SEPARATING SETS OF HYPERRECTANGLES
• Selecting a subset of diverse points based on the squared Euclidean distance
• Separating families of convex sets
• Title not available (Why is that?)
• Separation of points by families of intervals
• Separating sets in interpolation and geometry
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• The number of partitions of a set of N points in k dimensions induced by hyperplanes
• Complexity and approximation for discriminating and identifying code problems in geometric setups
• Separability of imprecise points
• Separation of two bounded point sets on the plane by a second order curve
• Computing Plurality Points and Condorcet Points in Euclidean Space

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

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