9786131233906 (4 résultats)

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational geometry, a sweep line algorithm or plane sweep algorithm is a type of algorithm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the key techniques in computational geometry.The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects. 72 pp. Englisch.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational geometry, a sweep line algorithm or plane sweep algorithm is a type of algorithm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the key techniques in computational geometry.The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects.

Taschenbuch. Etat : Neu. Sweep Line Algorithm | Computational Geometry, Scanline Algorithm, Computer Graphics | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131233906 | 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.

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. In computationalgeometry, a sweep line algorithm or plane sweep algorithm is a type ofalgorithm that uses a conceptual sweep line or sweep surface to solvevarious problems in Euclidean space. It is one of the key techniques incomputational geometry.The idea behind algorithms of this type is toimagine that a line (often a vertical line) is swept or moved across theplane, stopping at some points. Geometric operations are restricted togeometric objects that either intersect or are in the immediate vicinityof the sweep line whenever it stops, and the complete solution isavailable once the line has passed over all objects.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch.