Preprocessing Imprecise Points and Splitting Triangulations

DOI10.1137/090753620zbMath1211.65024OpenAlexW1972925770MaRDI QIDQ5390584

Joseph S. B. Mitchell, Maarten Löffler, Marc J. van Kreveld

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090753620

zbMATH Keywords

complexitytriangulationscomputational geometrypreprocessingdata imprecision

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items

Nearest-neighbor searching under uncertainty. I ⋮ Closest pair and the post office problem for stochastic points ⋮ Fréchet Distance for Uncertain Curves ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Preprocessing Ambiguous Imprecise Points