Algorithms in Combinatorial Geometry by Herbert Edelsbrunner
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa- tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con- structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com- binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.-
Fundamentals of Algebraic Graph Transformation
-
Models and Algorithms of Time-Dependent Scheduling
-
Theoretical Aspects of Distributed Computing in Sensor Networks
-
Handbook of Weighted Automata
-
Coping with Selfishness in Congestion Games
-
First-Order Programming Theories
-
Restricted-Orientation Convexity
-
Fault-Tolerant Search Algorithms
-
Patterns in Permutations and Words
-
Semantic Integration of Heterogeneous Software Specifications
-
Theoretical Aspects of Local Search
-
Computability
-
Syntax-Directed Semantics
-
The Logic of Partial Information
-
Computing in Horn Clause Theories
-
Nonsequential Processes
-
Data Structures and Algorithms 3
-
Relations and Graphs
-
Fundamentals of Algebraic Specification 1
-
Iteration Theories
-
Semirings, Automata, Languages
-
Data Structures and Algorithms 1
-
Petri Nets
-
Kolmogorov Complexity and Computational Complexity
-
Temporal Logic of Programs
-
Confluent String Rewriting
-
Fundamentals of Algebraic Specification 2
-
Parsing Theory
-
Finiteness and Regularity in Semigroups and Formal Languages
-
Coloured Petri Nets
-
Logics of Specification Languages
-
Graph and Model Transformation
-
Unfoldings
-
Stochastic Coalgebraic Logic
-
Process Algebras for Petri Nets
Edelsbrunner, Herbert: - Herbert Edelsbrunner is Arts and Sciences Professor of Computer Science at Duke University. He was the winner of the 1991 Waterman award from the National Science Foundation and is the founder and director of Raindrop Geomagic, a 3-D modelling company.
| SKU | Unavailable |
| ISBN 13 | 9783642648731 |
| ISBN 10 | 3642648738 |
| Title | Algorithms in Combinatorial Geometry |
| Author | Herbert Edelsbrunner |
| Series | Monographs In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2011-09-23 |
| Number of pages | 423 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |