Librería: Anybook.com, Lincoln, Reino Unido
EUR 13,24
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Fair. Volume 400. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:3540520554.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 57,92
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 60,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 61,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
EUR 56,77
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 59,72
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 84,01
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. Concrete and Abstract Voronoi Diagrams. Book.
EUR 66,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Berlin ; Heidelberg ; New York ; London ; Paris ; Tokyo ; Hong Kong : Springer,, 1989
ISBN 10: 3540520554 ISBN 13: 9783540520559
Librería: Schürmann und Kiewning GbR, Naumburg, Alemania
EUR 32,95
Cantidad disponible: 1 disponibles
Añadir al carritokartoniert. Condición: Gut. IV, 167 S. : graph. Darst. ; 24 cm Sprache: Englisch Gewicht in Gramm: 570.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 3540520554 ISBN 13: 9783540520559
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance to computer science and many other fields. The challenge is to compute Voronoi diagrams quickly. The problem is that their structure depends on the notion of distance and the sort of site. In this book the author proposes a unifying approach by introducing abstract Voronoi diagrams. These are based on the concept of bisecting curves, which are required to have some simple properties that are actually possessed by most bisectors of concrete Voronoi diagrams. Abstract Voronoi diagrams can be computed efficiently and there exists a worst-case efficient algorithm of divide-and-conquer type that applies to all abstract Voronoi diagrams satisfying a certain constraint. The author shows that this constraint is fulfilled by the concrete diagrams based on large classes of metrics in the plane.
EUR 50,25
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Concrete and Abstract Voronoi Diagrams | Rolf Klein | Taschenbuch | iv | Englisch | 1989 | Springer | EAN 9783540520559 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Dez 1989, 1989
ISBN 10: 3540520554 ISBN 13: 9783540520559
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 53,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance to computer science and many other fields. The challenge is to compute Voronoi diagrams quickly. The problem is that their structure depends on the notion of distance and the sort of site. In this book the author proposes a unifying approach by introducing abstract Voronoi diagrams. These are based on the concept of bisecting curves, which are required to have some simple properties that are actually possessed by most bisectors of concrete Voronoi diagrams. Abstract Voronoi diagrams can be computed efficiently and there exists a worst-case efficient algorithm of divide-and-conquer type that applies to all abstract Voronoi diagrams satisfying a certain constraint. The author shows that this constraint is fulfilled by the concrete diagrams based on large classes of metrics in the plane. 176 pp. Englisch.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1989
ISBN 10: 3540520554 ISBN 13: 9783540520559
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance.
Idioma: Inglés
Publicado por Springer, Springer Dez 1989, 1989
ISBN 10: 3540520554 ISBN 13: 9783540520559
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Voronoi diagram of a set of sites is a partition of the plane into regions, one to each site, such that the region of each site contains all points of the plane that are closer to this site than to the other ones. Such partitions are of great importance to computer science and many other fields. The challenge is to compute Voronoi diagrams quickly. The problem is that their structure depends on the notion of distance and the sort of site. In this book the author proposes a unifying approach by introducing abstract Voronoi diagrams. These are based on the concept of bisecting curves, which are required to have some simple properties that are actually possessed by most bisectors of concrete Voronoi diagrams. Abstract Voronoi diagrams can be computed efficiently and there exists a worst-case efficient algorithm of divide-and-conquer type that applies to all abstract Voronoi diagrams satisfying a certain constraint. The author shows that this constraint is fulfilled by the concrete diagrams based on large classes of metrics in the plane.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 176 pp. Englisch.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 151,79
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 176.