Advertisement

Table of contents

About this book

Introduction

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.

Keywords

Algorithm Algorithmic Geometry Algorithmische Geometrie Area Computational Geometry Computergeometrie Dynaische Algorithmen Dynamic Algorithms Randomisierte Algorithmen Randomized Algorrthms Voroni Diagram Voroni Diagramm algorithms complexity geometry

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-57503-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-57503-0
  • Online ISBN 978-3-540-48202-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site