Hyperplane separability and convexity of probabilistic point sets

DOI10.4230/LIPICS.SOCG.2016.38zbMATH Open1387.68259MaRDI QIDQ3132872FDOQ3132872

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

Publication date: 30 January 2018

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

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)

Cited In (10)

• Euclidean minimum spanning trees with independent and dependent geometric uncertainties
• Support vector machines and Radon's theorem
• Separation of integer points by a hyperplane under some weak notions of discrete convexity
• Computing the Expected Value and Variance of Geometric Measures
• Convex hulls under uncertainty
• Monotonicity of Linear Separability Under Translation
• Separability and Tight Enclosure of Point Sets
• Algorithms and Computation
• Half-plane point retrieval queries with independent and dependent geometric uncertainties
• Separability of imprecise points

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)