Lower Bounds for Geometric Diameter Problems

From MaRDI portal

Publication:3525782

Jump to:navigation, search

DOI10.1007/11682462_44zbMath1145.68556OpenAlexW1581208009MaRDI QIDQ3525782

Antoine Vigneron, Hervé Fournier

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://hal.inrae.fr/hal-02753352/file/36658_20101210034315096_1.pdf

zbMATH Keywords

convex polytope diameter lower bound computational geometry Hopcroft's problem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Lower Bounds for Geometric Diameter Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3525782&oldid=16893553"