Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Ordered stabbing of pairwise disjoint convex sets in linear time

Author
EGYED, P; WENGER, R
McGill univ., school computer sci., Montreal PQ H3A 2A7, Canada
Source

Discrete applied mathematics. 1991, Vol 31, Num 2, pp 133-140 ; ref : 13 ref

CODEN
DAMADU
ISSN
0166-218X
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Elsevier, Amsterdam / Elsevier, Lausanne / Elsevier, New York, NY
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Algorithme recherche Géométrie algorithmique Intersection Ordre Ensemble convexe Transversale ligne
Keyword (en)
Search algorithm Computational geometry Intersection Order Convex set
Keyword (es)
Algoritmo búsqueda Geometria algorítmica Intersección Orden Conjunto convexo
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02F Geometry / 001A02F02 Convex and discrete geometry

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4958886

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