Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19241130

A tight lower bound for computing the diameter of a 3D convex polytope

Author
FOURNIER, Hervé1 ; VIGNERON, Antoine2
[1] Laboratoire PRiSM, Université de Versailles Saint-Quentin-en-Yvelines, 45 avenue des États-Unis, 78035 Versailles, France
[2] INRA, UR341 Mathématiques et Informatique Appliquées, Domaine de Vilvert, 78352 Jouy-en-Josas, France
Source

Algorithmica. 2007, Vol 49, Num 3, pp 245-257, 13 p ; ref : 17 ref

ISSN
0178-4617
Scientific domain
Computer science
Publisher
Springer, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Computational geometry Convex polytope Diameter Hopcroft's problem Lower bound
Keyword (fr)
Borne inférieure Géométrie algorithmique Méthode cas pire Polytope convexe Structure arborescente Temps linéaire Théorie euclidienne
Keyword (en)
Lower bound Computational geometry Worst case method Convex polytope Tree structure Linear time Euclidean theory
Keyword (es)
Cota inferior Geometría computacional Método caso peor Politope convexo Estructura arborescente Tiempo lineal Teoría euclidiana
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
19241130

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web