On the separability of stochastic geometric objects, with applications

DOI10.1016/j.comgeo.2018.06.001zbMath1443.68210OpenAlexW2809377602WikidataQ129625496 ScholiaQ129625496MaRDI QIDQ1615884

Jie Xue, Ravi Janardan, Yu'an Li

Publication date: 31 October 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5954/

zbMATH Keywords

convex hulllinear separabilityexpected separation-marginseparable-probabilitystochastic objects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Geometric probability and stochastic geometry (60D99)

Related Items

Unnamed Item, Computing Shapley values in the plane

Cites Work

• Unnamed Item
• Largest and smallest convex hulls for imprecise points
• On the expected diameter, width, and complexity of a stochastic convex hull
• On the arrangement of stochastic lines in \(\mathbb{R}^2\)
• Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
• Convex hulls under uncertainty
• Containment and Evasion in Stochastic Point Data
• On the Most Likely Convex Hull of Uncertain Points
• On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
• Hyperplane separability and convexity of probabilistic point sets
• Separability of Imprecise Points
• Range searching on uncertain data
• Stochastic k-Center and j-Flat-Center Problems
• Nearest-Neighbor Searching Under Uncertainty II
• Stochastic minimum spanning trees in euclidean spaces