Computational Geometry: Algorithms and ApplicationsSpringer Science & Business Media, 17.04.2013 - 367 Seiten Computational geometry emerged from the field of algorithms design and anal ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic in formation systems (GIS), robotics, and others-in which geometric algorithms playafundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study. |
Im Buch
Ergebnisse 1-5 von 64
Seite 11
... data structure introduced in this book . Most of the applications stem from the areas of computer graphics , robotics , geographic information systems , and CAD / CAM . For those not familiar with these fields , we give a brief ...
... data structure introduced in this book . Most of the applications stem from the areas of computer graphics , robotics , geographic information systems , and CAD / CAM . For those not familiar with these fields , we give a brief ...
Seite 13
... data is one of the most important operations in a GIS . For example , we may ... structure studied in detail in Chapter 7 . CAD / CAM . Computer aided design ... data structures can be used to solve them . For example , in molecular ...
... data is one of the most important operations in a GIS . For example , we may ... structure studied in detail in Chapter 7 . CAD / CAM . Computer aided design ... data structures can be used to solve them . For example , in molecular ...
Seite 14
... data structure such that certain queries on the records can be answered efficiently . We hope that the above ... data structures , and techniques described in this book will provide you with the tools needed to attack such geometric ...
... data structure such that certain queries on the records can be answered efficiently . We hope that the above ... data structures , and techniques described in this book will provide you with the tools needed to attack such geometric ...
Seite 16
... data structure aspects are described in the two books of Samet [ 299 , 300 ] . The books by Faux and Pratt [ 147 ] , Mortenson [ 254 ] , and Hoffmann [ 187 ] are good introductory texts on CAD / CAM and geometric modeling . Section 1.5 ...
... data structure aspects are described in the two books of Samet [ 299 , 300 ] . The books by Faux and Pratt [ 147 ] , Mortenson [ 254 ] , and Hoffmann [ 187 ] are good introductory texts on CAD / CAM and geometric modeling . Section 1.5 ...
Seite 24
... data structures the algorithm uses . First of all we need a data structure - called the event queue - that stores the events . We denote the event queue by Q. We need an operation that re- moves the next event that will occur from Q ...
... data structures the algorithm uses . First of all we need a data structure - called the event queue - that stores the events . We denote the event queue by Q. We need an operation that re- moves the next event that will occur from Q ...
Inhalt
5 | |
17 | |
30 | |
5 | 40 |
4 | 57 |
2 | 66 |
Orthogonal Range Searching | 80 |
4 | 109 |
5 | 178 |
3 | 191 |
9 | 200 |
7 | 207 |
Convex Hulls | 236 |
Binary Space Partitions | 251 |
Robot Motion Planning | 267 |
2 A Point Robot | 270 |
8 | 117 |
3 | 129 |
6 | 144 |
3 | 154 |
4 | 162 |
2 | 169 |
Quadtrees | 291 |
Visibility Graphs | 307 |
Simplex Range Searching | 319 |
64 | 341 |
Index | 359 |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
2-dimensional associated structure beach line bound boundary BSP tree canonical subsets Chapter compute configuration space construct contains convex hull convex polygon corresponding data structure defined Delaunay triangulation denote disc doubly-connected edge list dual endpoint face facets Figure free space geometric half-edge half-plane Hence input inside interior intersection point interval tree kd-tree leaf Lemma lies line segments linear program mesh Minkowski sum motion planning number of edges number of reported O(n² O(nlogn objects obstacles P₁ partition tree pixel planar point location point q point stored pointers problem Proof prove Pstart quadtree query algorithm query point query range range queries range searching range tree recursive region robot search path search structure Section segment tree set of points shortest path simple polygon square subdivision subtree sweep line Theorem total number trapezoidal map triangles vertex vertical line visibility graph Vor(P Voronoi diagram xmid y-coordinate