Resultados de la búsqueda para Gift Wrapping Algorithm: Algorithm, Convex Hull, Time...
Imagen del vendedor
Gift Wrapping Algorithm
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131217696
ISBN 13: 9786131217692
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9786131217692
Comprar nuevo
EUR 34,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Gift Wrapping Algorithm : Algorithm, Convex Hull, Time Complexity
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9786131217692
Comprar nuevo
EUR 35,89
Envío por EUR 60,66
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Gift Wrapping Algorithm | Algorithm, Convex Hull, Time Complexity
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 113284338
Comprar nuevo
EUR 109,85
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Gift Wrapping Algorithm
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131217696
ISBN 13: 9786131217692
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9786131217692
Comprar nuevo
EUR 136,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles