Autor:	V. V. Panyukov
Rok vydání:	2003
Předmět:	Convex hull Discrete mathematics MathematicsofComputing_GENERAL Convex set Subderivative Combinatorics TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Convex polytope Convex combination Output-sensitive algorithm Gift wrapping algorithm Software Orthogonal convex hull Mathematics
Zdroj:	Programming and Computer Software. 29:112-119
ISSN:	0361-7688
Popis:	An algorithm for constructing the convex hull of a finite set of points in a d-dimensional space for a minimum number of iterations is proposed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::61423c4d38e5216677d250feaccfd9b1 https://doi.org/10.1023/a:1022956901778 Zobrazit plný text záznamu Full text from SpringerLink