Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

The Generation of Pseudo-Triangulated Spiral Polygon Using Convex Hull Layers

Author
TAHERKHANI, F1 ; NOUROLLAH, A1 2
[1] Department of Computer Engineering & IT, Islamic Azad University, Qazvin, Iran, Islamic Republic of
[2] Department of Electrical & Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran, Islamic Republic of
Conference title
FCS 2011 : proceedings of the 2011 international conference on foundations of computer science (Las Vegas NV, July 18-21, 2011)
Conference name
Foundations of computer science. International conference (Las Vegas NV 2010-07-18) = WorldComp'2011 (Las Vegas NV 2010-07-18)
Author (monograph)
Arabnia, Hamid R (Editor); Gravvanis, George A (Editor); Solo, Ashu M.G (Editor)
Source

FCS 2011 : proceedings of the 2011 international conference on foundations of computer science (Las Vegas NV, July 18-21, 2011). 2011, pp 51-56, 6 p ; ref : 6 ref

ISBN
1-60132-179-1
Scientific domain
Computer science
Publisher
CSREA Press, [S.l.]
Publication country
United States
Document type
Conference Paper
Language
English
Keyword (fr)
Algorithme optimal Approche probabiliste Ensemble aléatoire Enveloppe convexe Géométrie algorithmique Polygone convexe Triangulation
Keyword (en)
Optimal algorithm Probabilistic approach Random set Convex hull Computational geometry Convex polygon Triangulation
Keyword (es)
Algoritmo óptimo Enfoque probabilista Conjunto aleatorio Cápsula convexa Geometría computacional Polígono convexo Triangulación
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
26134124

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