New Trends in Discrete and Computational Geometry

Janos Pach

ISBN 10: 3642634494 / ISBN 13: 9783642634499

Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2013, 2013

Beschreibung

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 356 pp. Englisch.

Bestandsnummer des Verkäufers 9783642634499

Bibliografische Details

• Titel: New Trends in Discrete and Computational Geometry
• Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 2013
• Erscheinungsjahr: 2013
• Sprache: Englisch
• ISBN-10: 3642634494
• ISBN-13: 9783642634499
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

The most important new developments in discrete and computational geometry are summarized in this book. Special emphasis is put on those questions where the interaction between the two disciplines is the strongest. Concise and clear in style, this book introduces the most efficient combinatorial, probabilistic and topological methods that can be used to design effective geometric algorithms for motion planning, robotics, scene analysis, computer-aided design, etc. 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 transversal theory, partitions of Euclidean spaces and a general method for the analysis of randomized geometric algorithms. The chapters are self-con- tained surveys written by leading experts in the field. The book will be used by researchers, graduate students, and engineers interested in applications.

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.