Geometric avatar problems

DOI10.4230/LIPICS.FSTTCS.2013.389MaRDI QIDQ2963929zbMATH OpenOpenAlexFDO

Authors Mario Consuegra, Giri Narasimhan

Publication date 21 February 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2013.389

zbMATH Keywords

avatar problemschoice

Mathematics Subject Classification ID

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

Recommendations

• Fréchet distance between a line and avatar point set
• Fréchet distance between a line and avatar point set
• Geometric optimization revisited
• Some easy and some not so easy geometric optimization problems
• scientific article; zbMATH DE number 1974112

Cited in

(10)

• 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
• New results on stabbing segments with a polygon
• Network optimization on partitioned pairs of points
• Parameterized complexity of geometric covering problems having conflicts
• Fréchet distance between a line and avatar point set

This page was built for publication: Geometric avatar problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963929)