Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A MINIMUM SPANNING ELLIPSE ALGORITHM

Author
POST MJ
BROWN UNIV., DEP. COMPUTER SCI./PROVIDENCE RI 02912/USA
Source
ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 115-122; BIBL. 5 REF.
Document type
Conference Paper
Language
English
Keyword (fr)
ALGORITHME GEOMETRIE COMPLEXITE ALGORITHME ELLIPSE RECOUVRANTE OBJET CONVEXE MATHEMATIQUES APPLIQUEES
Keyword (en)
ALGORITHM GEOMETRY ALGORITHM COMPLEXITY APPLIED MATHEMATICS
Keyword (es)
MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL82X0285801

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

Searching the Web