LEADER 01791nam2 22003493i 450 001 SUN0098084 005 20140606112825.38 010 $a978-88-13-27807-6$d0.00 100 $a20140606d2007 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aˆ<> 2$fa cura di Cesare Massimo Bianca e Francesco Donato Busnelli 205 $aPadova : CEDAM$b2007 210 $aXIV$d1014-2200 p. ; 25 cm 215 $aFondo SSPL. 461 1$1001SUN0098082$12001 $aˆLa ‰protezione dei dati personali$ecommentario al D. lgs. 30 giugno 2003, n. 196, Codice della privacy$fa cura di Cesare Massimo Bianca e Francesco Donato Busnelli$gcoordinamento redazionale: Valentina Gagliardi, Enza Pellecchia$v2$1210 $aPadova$cCEDAM$d2007$1215 $a2 vol.$d25 cm. 620 $dPadova$3SUNL000007 702 1$aBusnelli$b, Francesco D.$3SUNV000791 702 1$aBianca$b, Cesare Massimo$3SUNV002815 702 1$aPellecchia$b, Enza$3SUNV032641 702 1$aGagliardi$b, Valentina$3SUNV077461 712 $aCEDAM$3SUNV005537$4650 790 1$aBusnelli, Francesco Donato$zBusnelli, Francesco D.$3SUNV065426 790 1$aBianca, Massimo C.$zBianca, Cesare Massimo$3SUNV001477 790 1$aBianca, Cesare Massimo$zBianca, Cesare Massimo$3SUNV080046 801 $aIT$bSOL$c20181109$gRICA 912 $aSUN0098084 950 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$d00 CONS SSPL.252 (2) $e00 SPL410 995 $aUFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA$gSPL$h410$kCONS SSPL.252 (2)$op$qa 996 $aProtezione dei dati personali$9713797 997 $aUNICAMPANIA LEADER 04058nam 22007335 450 001 996465730403316 005 20200701101930.0 010 $a3-540-46874-9 024 7 $a10.1007/3-540-52055-4 035 $a(CKB)1000000000233481 035 $a(SSID)ssj0000322214 035 $a(PQKBManifestationID)11268102 035 $a(PQKBTitleCode)TC0000322214 035 $a(PQKBWorkID)10281493 035 $a(PQKB)11632483 035 $a(DE-He213)978-3-540-46874-5 035 $a(PPN)155187279 035 $a(EXLCZ)991000000000233481 100 $a20121227d1989 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aConcrete and Abstract Voronoi Diagrams$b[electronic resource] /$fby Rolf Klein 205 $a1st ed. 1989. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989. 215 $a1 online resource (IV, 169 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v400 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-52055-4 327 $aVoronoi diagrams in nice metrics -- Abstract Voronoi diagrams -- Computing abstract Voronoi diagrams -- Acyclic partitions -- Concluding remarks. 330 $aThe 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v400 606 $aComputers 606 $aApplication software 606 $aInformation storage and retrieval 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer graphics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Applications$3https://scigraph.springernature.com/ontologies/product-market-codes/I23001 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aApplication software. 615 0$aInformation storage and retrieval. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aComputer Applications. 615 24$aInformation Storage and Retrieval. 615 24$aData Structures. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputer Graphics. 676 $a004.0151 700 $aKlein$b Rolf$4aut$4http://id.loc.gov/vocabulary/relators/aut$0916505 906 $aBOOK 912 $a996465730403316 996 $aConcrete and Abstract Voronoi Diagrams$92830565 997 $aUNISA LEADER 00957nam a22002411i 4500 001 991002605609707536 005 20030721133848.0 008 030925s1934 it |||||||||||||||||ita 035 $ab12312538-39ule_inst 035 $aARCHE-036007$9ExL 040 $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a070.5909 100 1 $aVallecchi, Attilio$0444700 245 10$aRicordi e idee di un editore vivente /$cAttilio Vallecchi 260 $aFirenze :$bVallecchi,$c1934 300 $a250 p. ;$c20 cm 650 4$aIndustria editoriale$xItalia$xSec. 20.$xDiari e memorie 907 $a.b12312538$b02-04-14$c08-10-03 912 $a991002605609707536 945 $aLE002 It. XIII E 28 (Fondo Ferretti)$g1$i2002000177223$lle002$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i12709554$z08-10-03 996 $aRicordi e idee di un editore vivente$990243 997 $aUNISALENTO 998 $ale002$b08-10-03$cm$da $e-$fita$git $h0$i1