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 43
Seite v
... plane sweep , and randomized algorithms . We decided not to treat all sorts of variations to the problems ; we felt it is more important to introduce all main topics in computational geometry than to give more detailed information about ...
... plane sweep , and randomized algorithms . We decided not to treat all sorts of variations to the problems ; we felt it is more important to introduce all main topics in computational geometry than to give more detailed information about ...
Seite vi
... plane sweep algorithms , and it is best to read this chapter before any of the other chapters that use this technique . Similarly , Chapter 4 should be read before any other chapter that uses randomized algorithms . For a first course ...
... plane sweep algorithms , and it is best to read this chapter before any of the other chapters that use this technique . Similarly , Chapter 4 should be read before any other chapter that uses randomized algorithms . For a first course ...
Seite 22
... plane sweep algorithm and the line l is called the sweep line . The status of the sweep line is the set of segments intersecting it . The status changes while the sweep line moves downwards , but not contin- uously . Only at particular ...
... plane sweep algorithm and the line l is called the sweep line . The status of the sweep line is the set of segments intersecting it . The status changes while the sweep line moves downwards , but not contin- uously . Only at particular ...
Seite 23
... sweep line reaches the endpoint . So the only question is whether intersections between the interiors of segments ... plane sweep algorithm . Let's briefly recap the overall approach . We imagine moving a hor- izontal sweep line ...
... sweep line reaches the endpoint . So the only question is whether intersections between the interiors of segments ... plane sweep algorithm . Let's briefly recap the overall approach . We imagine moving a hor- izontal sweep line ...
Seite 24
... swept the whole plane - more precisely , after we have treated the last event point - we have computed all intersection points . This is guar- anteed by the following invariant , which holds at any time during the plane sweep : all ...
... swept the whole plane - more precisely , after we have treated the last event point - we have computed all intersection points . This is guar- anteed by the following invariant , which holds at any time during the plane sweep : all ...
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