On the Most Likely Convex Hull of Uncertain Points

DOI10.1007/978-3-642-40450-4_67zbMath1394.68422OpenAlexW581837698MaRDI QIDQ2849366

Kevin Verbeek, Hakan Yildiz, Subhash Suri

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_67

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (22)

On the separability of stochastic geometric objects, with applications ⋮ Separability of imprecise points ⋮ On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Computing the Expected Value and Variance of Geometric Measures ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Minimum color spanning circle of imprecise points ⋮ Convex hulls under uncertainty ⋮ Fréchet Distance for Uncertain Curves ⋮ Unnamed Item ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ The Most Likely Object to be Seen Through a Window ⋮ Largest and smallest area triangles on imprecise points ⋮ Computing the center of uncertain points on tree networks ⋮ Maximum box problem on stochastic points ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Covering uncertain points in a tree ⋮ The most-likely skyline problem for stochastic points ⋮ On the expected diameter, width, and complexity of a stochastic convex hull ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model ⋮ Expected computations on color spanning sets

This page was built for publication: On the Most Likely Convex Hull of Uncertain Points