Towards Dynamic Randomized Algorithms in Computational Geometry by Monique Teill

Description: Towards Dynamic Randomized Algorithms in Computational Geometry by Monique Teillaud 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. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description 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. Notes Springer Book Archives Table of Contents 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. Promotional Springer Book Archives Long Description 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. Details ISBN3540575030 Author Monique Teillaud Short Title TOWARDS DYNAMIC RANDOMIZED ALG Series Lecture Notes in Computer Science Language English ISBN-10 3540575030 ISBN-13 9783540575030 Media Book Format Paperback Series Number 758 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Birth 1961 Pages 169 DOI 10.1007/b52550;10.1007/3-540-57503-0;10.1007/978-3-540-48202-4 Edited by Teillaud, M. Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Edition Description 1993 ed. Year 1993 Edition 1993rd Publication Date 1993-11-23 DEWEY 004.01 Illustrations XI, 169 p. Audience Postgraduate, Research & Scholarly We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96277812;

Price: 116.58 AUD

Location: Melbourne

End Time: 2025-02-05T06:18:30.000Z

Shipping Cost: 11.52 AUD