On the Most Likely Convex Hull of Uncertain Points
DOI10.1007/978-3-642-40450-4_67zbMATH Open1394.68422OpenAlexW581837698MaRDI QIDQ2849366FDOQ2849366
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
Recommendations
- Convex hulls under uncertainty
- Convex hulls under uncertainty
- Convex hulls of perturbed random point sets
- Approximating largest convex hulls for imprecise points
- Approximating Largest Convex Hulls for Imprecise Points
- On the convex hull of random points in a polytope
- On the shape of the convex hull of random points
- Largest and smallest convex hulls for imprecise points
- Inequalities for convex hulls of random points
- scientific article
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (23)
- Maximum box problem on stochastic points
- On the separability of stochastic geometric objects, with applications
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
- Covering uncertain points in a tree
- Fréchet Distance for Uncertain Curves
- On the expected diameter, width, and complexity of a stochastic convex hull
- Computing the Expected Value and Variance of Geometric Measures
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Expected computations on color spanning sets
- Convex hulls under uncertainty
- The Most Likely Object to be Seen Through a Window
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
- Minimum color spanning circle of imprecise points
- Title not available (Why is that?)
- Largest and smallest area triangles on imprecise points
- Title not available (Why is that?)
- The most-likely skyline problem for stochastic points
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Separability of imprecise points
- Computing the Center of Uncertain Points on Tree Networks
- Computing the center of uncertain points on tree networks
- Computing the Rectilinear Center of Uncertain Points in the Plane
This page was built for publication: On the Most Likely Convex Hull of Uncertain Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849366)
