Half-plane point retrieval queries with independent and dependent geometric uncertainties
From MaRDI portal
Publication:6110075
Cites work
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Approximate range searching
- Closest pair and the post office problem for stochastic points
- Computational geometry with independent and dependent uncertainties
- Constructing strongly convex approximate hulls with inaccurate primitives
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Geometric retrieval problems
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- Hyperplane separability and convexity of probabilistic point sets
- Largest and smallest convex hulls for imprecise points
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Optimal solutions for a class of point retrieval problems
- Point set distance and orthogonal range problems with dependent geometric uncertainties
- Polygon Retrieval
- Robust optimization
- Stochastic minimum spanning trees in Euclidean spaces
- The power of geometric duality
- Uncertain Voronoi diagram
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
This page was built for publication: Half-plane point retrieval queries with independent and dependent geometric uncertainties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110075)