Half-plane point retrieval queries with independent and dependent geometric uncertainties
From MaRDI portal
Publication:6110075
DOI10.1016/j.comgeo.2023.102021OpenAlexW4380319233MaRDI QIDQ6110075
Publication date: 31 July 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2023.102021
dependent and independent geometric uncertaintyuncertain point locationhalf-plane point retrieval query
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest and smallest convex hulls for imprecise points
- Uncertain Voronoi diagram
- Optimal solutions for a class of point retrieval problems
- The power of geometric duality
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Approximate range searching
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Constructing strongly convex approximate hulls with inaccurate primitives
- Convex hulls under uncertainty
- Geometric retrieval problems
- Polygon Retrieval
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- Computational Geometry with Independent and Dependent Uncertainties
- Closest Pair and the Post Office Problem for Stochastic Points
- POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
- Stochastic minimum spanning trees in euclidean spaces
This page was built for publication: Half-plane point retrieval queries with independent and dependent geometric uncertainties