Sinossi
Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Towards Dynamic Randomized Algorithms in Computational...
Immagini fornite dal venditore
Towards dynamic randomized algorithms in computational geometry.
Da: Emile Kerssemakers ILAB, Heerlen, Paesi Bassi
Valutazione del venditore 5 su 5 stelle
23 cm. original paperback. 158 pp. diagrams. bibliography. index. "Lecture Notes in Computer Science". -(libr labels, otherwise (very) good). 250g. Codice articolo 71736
Compra usato
EUR 25,00
Spedizione EUR 33,00
Spedito da Paesi Bassi a U.S.A.
Spedito da Paesi Bassi a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Towards Dynamic Randomized Algorithms in Computational Geometry.
Editore:
Berlin, Springer Berlin Heidelberg, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Antico o usato
Brossura
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7943 3540575030 Sprache: Englisch Gewicht in Gramm: 900. Codice articolo 2347641
Compra usato
EUR 52,60
Spedizione EUR 40,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Towards Dynamic Randomized Algorithms in Computational Geometry
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to dev. Codice articolo 4894346
Compra nuovo
EUR 48,37
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Towards Dynamic Randomized Algorithms in Computational Geometry
Editore:
Springer Berlin Heidelberg Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms. 180 pp. Englisch. Codice articolo 9783540575030
Compra nuovo
EUR 74,89
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Towards Dynamic Randomized Algorithms in Computational Geometry
Editore:
Springer, Springer Nov 1993, 1993
ISBN 10: 3540575030
ISBN 13: 9783540575030
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Computational geometry concerns itself with designing andanalyzing 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 180 pp. Englisch. Codice articolo 9783540575030
Compra nuovo
EUR 53,49
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Towards Dynamic Randomized Algorithms in Computational Geometry
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry concerns itself with designing andanalyzing algorithms for solving geometric problems. Thefield has reached a high level of sophistication, and verycomplicated algorithms have been designed.However, it isalso useful to develop more practical algorithms, so long asthey are based on rigorous methods. One such method is theuse of randomized algorithms. These algorithms have becomemore and more popular, turning into one of the hottest areasof recent years. Dynamic algorithms are particularlyinteresting because in practice the data of a problem areoften acquired progressively. In this monograph the authorstudies the theoretical complexity and practical efficiencyof randomized dynamic algorithms. Codice articolo 9783540575030
Compra nuovo
EUR 53,49
Spedizione EUR 61,42
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili