POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
From MaRDI portal
Publication:5300009
DOI10.1142/S0218195912500148zbMath1267.68275MaRDI QIDQ5300009
Publication date: 24 June 2013
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
imprecise pointsdependent point location uncertaintyuncertain orthogonal range queryuncertain point set distance problemsuncertain relative positioning
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Data imprecision under \(\lambda\)-geometry model
Cites Work
- Largest and smallest convex hulls for imprecise points
- Representation and interpretation of geometric tolerances for polyhedral objects. II: Size, orientation and position tolerances.
- Approximate range searching
- Structural tolerance and Delaunay triangulation
- Systems of distant representatives
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
This page was built for publication: POINT SET DISTANCE AND ORTHOGONAL RANGE PROBLEMS WITH DEPENDENT GEOMETRIC UNCERTAINTIES
