Geometric Avatar Problems
From MaRDI portal
Publication:2963929
DOI10.4230/LIPIcs.FSTTCS.2013.389zbMath1359.68281MaRDI QIDQ2963929
Giri Narasimhan, Mario Consuegra
Publication date: 21 February 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2013.389
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Unnamed Item, Parameterized complexity of geometric covering problems having conflicts, New results on stabbing segments with a polygon, Fréchet distance between a line and avatar point set, Selecting and covering colored points, On the \(k\)-colored rainbow sets in fixed dimensions, Minimum color spanning circle of imprecise points, Approximation algorithms for geometric conflict free covering problems, A fully polynomial time approximation scheme for the smallest diameter of imprecise points, Minimum color spanning circle in imprecise setup