Concrete and Abstract Voronoi Diagrams - Lecture Notes in Computer Science - Rolf-dieter Klein - Grāmatas - Springer-Verlag Berlin and Heidelberg Gm - 9783540520559 - 1989. gada 20. decembris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Concrete and Abstract Voronoi Diagrams - Lecture Notes in Computer Science 1989 edition

Cena
€ 63,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 14. - 28. aug.
Saņemiet paziņojumus par jauniem Rolf-dieter Klein izdevumiem
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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.


173 pages, biography

Mediji Grāmatas     Paperback Book   (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists 1989. gada 20. decembris
ISBN13 9783540520559
Izdevēji Springer-Verlag Berlin and Heidelberg Gm
Lapas 173
Izmēri 156 × 234 × 9 mm   ·   254 g
Valoda Angļu   Franču  

Vairāk no Rolf-dieter Klein

Rādīt visu

Vairāk no tā paša izdevēja