|
|
|
|
| LEADER |
03282nmm a2200313 u 4500 |
| 001 |
EB000668216 |
| 003 |
EBX01000000000000000521298 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642615689
|
| 100 |
1 |
|
|a Edelsbrunner, Herbert
|
| 245 |
0 |
0 |
|a Algorithms in Combinatorial Geometry
|h Elektronische Ressource
|c by Herbert Edelsbrunner
|
| 250 |
|
|
|a 1st ed. 1987
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1987, 1987
|
| 300 |
|
|
|a XV, 423 p
|b online resource
|
| 505 |
0 |
|
|a I Combinatorial Geometry -- 1 Fundamental Concepts in Combinatorial Geometry -- 2 Permutation Tables -- 3 Semispaces of Configurations -- 4 Dissections of Point Sets -- 5 Zones in Arrangements -- 6 The Complexity of Families of Cells -- II Fundamental Geometric Algorithms -- 7 Constructing Arrangements -- 8 Constructing Convex Hulls -- 9 Skeletons in Arrangements -- 10 Linear Programming. -- 11 Planar Point Location Search -- III Geometric and Algorithmic Applications -- 12 Problems for Configurations and Arrangements -- 13 Voronoi Diagrams -- 14 Separation and Intersection in the Plane -- 15 Paradigmatic Design of Algorithms -- References -- Appendix A Definitions -- Appendix B Notational Conventions
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-61568-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-61568-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518.1
|
| 520 |
|
|
|a 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
|