New Trends in Discrete and Computational Geometry: v. 10 (Algorithms and Combinatorics) - Hardcover

 
9783540557135: New Trends in Discrete and Computational Geometry: v. 10 (Algorithms and Combinatorics)
Hardcover
ISBN 10: 354055713X ISBN 13: 9783540557135
Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1993

Inhaltsangabe

Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis and computer aided design. This book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. The authors give self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis, and computer aided design. The book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. All authors are well-known experts in these fields. They give concise and self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. Most of the methods and results discussed in the book have not appeared in any previously published monograph. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. Apart from mathematicians working in discrete and computational geometry this book will also be of great use to computer scientists and engineers, who would like to learn about the most recent results.

Reseña del editor

Discrete and computational geometry are two fields which in recent years have benefitted from the interaction between mathematics and computer science. The results are applicable in areas such as motion planning, robotics, scene analysis and computer aided design. This book consists of twelve chapters summarizing the most recent results and methods in discrete and computational geometry. The authors give self-contained surveys of the most efficient combinatorical, probabilistic and topological methods that can be used to design effective geometric algorithms for the applications mentioned above. In particular, this book contains the first systematic treatment of epsilon-nets, geometric tranversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Erscheinungsdatum
1993
Sprache
Englisch
ISBN 10 
354055713X
ISBN 13 
9783540557135
Einband
Tapa dura
Anzahl der Seiten
351
Herausgeber
Pach Janos
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Deutschland

Weitere beliebte Ausgaben desselben Titels

9783642634499: New Trends in Discrete and Computational Geometry: 10 (Algorithms and Combinatorics)

Vorgestellte Ausgabe

ISBN 10:  3642634494 ISBN 13:  9783642634499
Verlag: Springer, 2013
Softcover