Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Geometric Avatar Problems

From MaRDI portal
Publication:2963929
Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2013.389zbMath1359.68281OpenAlexW1509960071MaRDI QIDQ2963929

Giri Narasimhan, Mario Consuegra

Publication date: 21 February 2017

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


zbMATH Keywords

choiceavatar problems


Mathematics Subject Classification ID

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


Related Items (10)

On the \(k\)-colored rainbow sets in fixed dimensions ⋮ Minimum color spanning circle of imprecise points ⋮ Minimum color spanning circle in imprecise setup ⋮ Approximation algorithms for geometric conflict free covering problems ⋮ New results on stabbing segments with a polygon ⋮ Fréchet distance between a line and avatar point set ⋮ Selecting and covering colored points ⋮ Parameterized complexity of geometric covering problems having conflicts ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Unnamed Item






This page was built for publication: Geometric Avatar Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2963929&oldid=15970203"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki