Lower bounds for geometric diameter problems

The diameter of a set P of n points in R-d is the maximum Euclidean distance between any two points in P. If P is the vertex set of a 3-dimensional convex polytope, and if the combinatorial structure of this polytope is given, we prove that, in the worst case, deciding whether the diameter of P is s...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Fournier , H. (Université de Versailles Saint Quentin-en-Yvelines, Versailles(France). Laboratoire PRiSM), Vigneron , Antoine (INRA (France). UR 0341 Unité de recherche Mathématiques et Informatique Appliquées)
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computational geometry Computer Science Computer science control theory systems Convex polytope Diameter diametre de probleme hopcroft Exact sciences and technology geometrie algorithmique Hopcroft’s problem INFORMATIQUE Lower bound Mathematics point set polytope convexe Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!