Algorithms for weak and wide separation of sets

DOI10.1016/0166-218X(93)90057-UzbMath0797.68160MaRDI QIDQ686422

Michael E. Houle

Publication date: 19 October 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

arrangementspattern recognitioncomputational geometryseparationdual transformlinear separatorsspherical separators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Separability of imprecise points ⋮ Separability by two lines and by nearly straight polygonal chains ⋮ SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS ⋮ RED-BLUE SEPARABILITY PROBLEMS IN 3D ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ Lower bounds for the number of hyperplanes separating two finite sets of points ⋮ Algorithms for Radon partitions with tolerance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing circular separability
• Voronoi diagrams and arrangements
• Voronoi diagrams from convex hulls
• Stabbing line segments
• Linear programming in \(O(n\times 3^{d^2})\) time
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• A linear algorithm for determining the separation of convex polyhedra
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Computing the extreme distances between two convex polygons
• Linear Programming in Linear Time When the Dimension Is Fixed
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Enumeration of Seven-Argument Threshold Functions
• Partition of Space

This page was built for publication: Algorithms for weak and wide separation of sets