Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Placing guards inside orthogonal polygons

Author
GEWALI, L. P
Univ. Nevada, dep. computer sci., Las Vegas NV 89154, United States
Source

Information sciences. 1996, Vol 88, Num 1-4, pp 1-14 ; ref : 17 ref

CODEN
ISIJBC
ISSN
0020-0255
Scientific domain
Documentation; Computer science
Publisher
Elsevier Science, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme rapide Complexité temps Géométrie algorithmique Minimum Polygone Visibilité Art gallery problem Boundary point solution Orthogonal polygon
Keyword (en)
Fast algorithm Time complexity Computational geometry Minimum Polygon Visibility
Keyword (es)
Algoritmo rápido Complejidad tiempo Geometría computacional Mínimo Polígono Visibilidad
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02F Geometry / 001A02F01 Geometry

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A02 Optimization. Search problems

Discipline
Mathematics Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
3006889

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