Separating collections of points in Euclidean spaces

DOI10.1016/0020-0190(94)00186-3MaRDI QIDQ674178zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Separating families of convex sets
• Separation of convex sets
• On the complexity of polyhedral separability
• scientific article; zbMATH DE number 4213450

Cites work

• scientific article; zbMATH DE number 3692229 (Why is no real title available?)
• scientific article; zbMATH DE number 3223483 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• A seperation property of plane convex sets.
• Algorithms for ham-sandwich cuts
• Cutting disjoint disks by straight lines
• Non-partitionable point sets
• Partitioning with two lines in the plane
• Polygon Retrieval
• Separating convex sets in the plane

Cited in

(24)

• Separating families of convex sets
• Separation of two bounded point sets on the plane by a second order curve
• Selecting a subset of diverse points based on the squared Euclidean distance
• Separability of imprecise points
• Separation of points by families of intervals
• Separating and shattering long line segments
• The number of partitions of a set of N points in k dimensions induced by hyperplanes
• scientific article; zbMATH DE number 6850368 (Why is no real title available?)
• On separating convex points with lines
• Separating sets in interpolation and geometry
• On separating points by lines
• Halving balls by a hyperplane in deterministic linear time
• Hyperplane separability and convexity of probabilistic point sets
• Separation of convex sets
• Hyperplane separability and convexity of probabilistic point sets
• Identification of points using disks
• Complexity and approximation for discriminating and identifying code problems in geometric setups
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• SEPARATING SETS OF HYPERRECTANGLES
• Separating pairs of points of standard boxes
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Discriminating Codes in Geometric Setups
• On the complexity of polyhedral separability
• Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes

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)