Sinossi
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The gift wrapping algorithm is a simple algorithm for computing the convex hull of a given set of points.In the two-dimensional case the algorithm is also known as Jarvis march, after R. A. Jarvis, who published it in 1973; it has O(nh) time complexity, where n is the number of points and h is the number of points on the convex hull. Its real-life performance compared with other convex hull algorithms is favorable when n is small or h is expected to be very small with respect to n. In general cases the algorithm is outperformed by many others.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per Gift Wrapping Algorithm: Algorithm, Convex Hull, Time...
Immagini fornite dal venditore
Gift Wrapping Algorithm
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. The gift wrapping algorithm is a simple algorithm for computing the convex hull of a given set of points.In the two-dimensional case the algorithm is also known as Jarvis march, after R. A. Jarvis, who published it in 1973; it has O(nh) time complexity, where n is the number of points and h is the number of points on the convex hull. Its real-life performance compared with other convex hull algorithms is favorable when n is small or h is expected to be very small with respect to n. In general cases the algorithm is outperformed by many others. 76 pp. Englisch. Codice articolo 9786131217692
Compra nuovo
EUR 34,00
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Gift Wrapping Algorithm : Algorithm, Convex Hull, Time Complexity
Print on DemandDa: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. The gift wrapping algorithm is a simple algorithm for computing the convex hull of a given set of points.In the two-dimensional case the algorithm is also known as Jarvis march, after R. A. Jarvis, who published it in 1973; it has O(nh) time complexity, where n is the number of points and h is the number of points on the convex hull. Its real-life performance compared with other convex hull algorithms is favorable when n is small or h is expected to be very small with respect to n. In general cases the algorithm is outperformed by many others. Codice articolo 9786131217692
Compra nuovo
EUR 35,89
Spedizione EUR 60,66
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Gift Wrapping Algorithm | Algorithm, Convex Hull, Time Complexity
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Gift Wrapping Algorithm | Algorithm, Convex Hull, Time Complexity | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131217692 | 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. Codice articolo 113284338
Compra nuovo
EUR 109,85
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Immagini fornite dal venditore
Gift Wrapping Algorithm
Print on DemandDa: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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 gift wrappingalgorithm is a simple algorithm for computing the convex hull of a givenset of points.In the two-dimensional case the algorithm is also known asJarvis march, after R. A. Jarvis, who published it in 1973; it has O(nh)time complexity, where n is the number of points and h is the number ofpoints on the convex hull. Its real-life performance compared with otherconvex hull algorithms is favorable when n is small or h is expected tobe very small with respect to n. In general cases the algorithm isoutperformed by many others.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. Codice articolo 9786131217692
Compra nuovo
EUR 136,00
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili