03497nam 22006855 450 99646577310331620200705124319.03-540-48202-410.1007/3-540-57503-0(CKB)1000000000234060(SSID)ssj0000327345(PQKBManifestationID)11276290(PQKBTitleCode)TC0000327345(PQKBWorkID)10301612(PQKB)10011404(DE-He213)978-3-540-48202-4(PPN)155237632(EXLCZ)99100000000023406020121227d1993 u| 0engurnn|008mamaatxtccrTowards Dynamic Randomized Algorithms in Computational Geometry[electronic resource] /by Monique Teillaud1st ed. 1993.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1993.1 online resource (XI, 169 p.) Lecture Notes in Computer Science,0302-9743 ;758Bibliographic Level Mode of Issuance: Monograph3-540-57503-0 Fundamental structures -- Static randomized incremental algorithms -- The Delaunay tree -- A general structure: The influence graph -- The k-Delaunay tree -- Towards a fully dynamic structure -- Parallel work.Computational geometry concerns itself with designing and analyzing algorithms for solving geometric problems. The field has reached a high level of sophistication, and very complicated algorithms have been designed.However, it is also useful to develop more practical algorithms, so long as they are based on rigorous methods. One such method is the use of randomized algorithms. These algorithms have become more and more popular, turning into one of the hottest areas of recent years. Dynamic algorithms are particularly interesting because in practice the data of a problem are often acquired progressively. In this monograph the author studies the theoretical complexity and practical efficiency of randomized dynamic algorithms.Lecture Notes in Computer Science,0302-9743 ;758ComputersComputer graphicsAlgorithmsCombinatoricsGeometryTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Geometryhttps://scigraph.springernature.com/ontologies/product-market-codes/M21006Computers.Computer graphics.Algorithms.Combinatorics.Geometry.Theory of Computation.Computer Graphics.Algorithm Analysis and Problem Complexity.Combinatorics.Geometry.516/.13/028551Teillaud Moniqueauthttp://id.loc.gov/vocabulary/relators/aut714596BOOK996465773103316Towards dynamic randomized algorithms in computational geometry1381927UNISA