Largest and Smallest Tours and Convex Hulls for Imprecise Points
From MaRDI portal
Publication:5757883
DOI10.1007/11785293_35zbMath1141.68637OpenAlexW2151954874MaRDI QIDQ5757883
Maarten Löffler, Marc J. van Kreveld
Publication date: 7 September 2007
Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11785293_35
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ Fréchet Distance for Uncertain Curves ⋮ Query-competitive algorithms for cheapest set problems under uncertainty ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Triangulating input-constrained planar point sets ⋮ Approximating Largest Convex Hulls for Imprecise Points ⋮ Expected computations on color spanning sets