Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Warnock algorithm is a hidden surface algorithm invented by John Warnock that is typically used in the field of computer graphics. It works by recursive subdivision of a scene until areas are obtained that are trivial to compute. It solves the problem of rendering a complicated image by avoiding the problem. If the scene is simple enough to compute then it is rendered; otherwise it is divided into smaller parts and the process is repeated.This is a divide and conquer algorithm with run-time of O(np), where n is the number of polygons and p is the number of pixels in the viewport.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 76 pp. Englisch. N° de réf. du vendeur 9786133640511
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Warnock Algorithm | John Warnock, Divide and Conquer Algorithm, Computer Programming, Analysis of Algorithms, Computer Graphics | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786133640511 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. N° de réf. du vendeur 134993484
Quantité disponible : 5 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. The Warnockalgorithm is a hidden surface algorithm invented by John Warnock that istypically used in the field of computer graphics. It works by recursivesubdivision of a scene until areas are obtained that are trivial tocompute. It solves the problem of rendering a complicated image byavoiding the problem. If the scene is simple enough to compute then itis rendered; otherwise it is divided into smaller parts and the processis repeated.This is a divide and conquer algorithm with run-time ofO(np), where n is the number of polygons and p is the number of pixelsin the viewport.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. N° de réf. du vendeur 9786133640511
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering. N° de réf. du vendeur 9786133640511
Quantité disponible : 1 disponible(s)