Closest Pair and the Post Office Problem for Stochastic Points

DOI10.1007/978-3-642-22300-6_46zbMath1342.68338OpenAlexW1810559539MaRDI QIDQ5199272

Pegah Kamousi, Timothy M. Chan, Subhash Suri

Publication date: 12 August 2011

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-22300-6_46

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (12)

Computing the Center of Uncertain Points on Tree Networks ⋮ Computing the Rectilinear Center of Uncertain Points in the Plane ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Clustering with faulty centers ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ On the Most Likely Voronoi Diagram and Nearest Neighbor Searching ⋮ One-dimensional \(k\)-center on uncertain data ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Computing the center of uncertain points on tree networks ⋮ Covering uncertain points in a tree ⋮ Expected computations on color spanning sets

This page was built for publication: Closest Pair and the Post Office Problem for Stochastic Points