Hyperplane separability and convexity of probabilistic point sets

DOI10.4230/LIPICS.SOCG.2016.38zbMATH1387.68259MaRDI QIDQ3132872FDOQ3132872

Authors Martin Fink, Nirman Kumar, John Hershberger, Subhash Suri

Publication date 30 January 2018

zbMATH Keywords

uncertain datamulti-dimensional datatopological sweephyperplane separationprobabilistic separability3-SUM hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Geometric probability and stochastic geometry (60D99)

Recommendations

• Hyperplane separability and convexity of probabilistic point sets
• On the separability of stochastic geometric objects, with applications
• On the separability of stochastic geometric objects, with applications
• Separating collections of points in Euclidean spaces
• Algorithms and Computation

Cited in

(13)

• Separability of imprecise points
• Separability and Tight Enclosure of Point Sets
• Active-learning a convex body in low dimensions
• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• On the separability of stochastic geometric objects, with applications
• Monotonicity of Linear Separability Under Translation
• On the separability of stochastic geometric objects, with applications
• Hyperplane separability and convexity of probabilistic point sets
• Separation of integer points by a hyperplane under some weak notions of discrete convexity
• Half-plane point retrieval queries with independent and dependent geometric uncertainties
• Computing the Expected Value and Variance of Geometric Measures
• Algorithms and Computation
• Support vector machines and Radon's theorem

This page was built for publication: Hyperplane separability and convexity of probabilistic point sets

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