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 83
Seite 4
... Figure 1.1 P4 , P5 , P8 , P2 , P9 P8 The first definition of convex hulls is of little help when we want to design an algorithm to compute the convex hull . It talks about the intersection of all convex sets containing P , of which ...
... Figure 1.1 P4 , P5 , P8 , P2 , P9 P8 The first definition of convex hulls is of little help when we want to design an algorithm to compute the convex hull . It talks about the intersection of all convex sets containing P , of which ...
Seite 12
... figure out the best way to execute the task . This involves planning motions , planning the order in which to perform subtasks , and so on . Other geometric problems occur in the design of robots and work cells in which the robot has to ...
... figure out the best way to execute the task . This involves planning motions , planning the order in which to perform subtasks , and so on . Other geometric problems occur in the design of robots and work cells in which the robot has to ...
Seite 20
... Figure 2.1 . Using an overlay of the road map and the map storing cities you can now figure out how to get to the town . When two or more thematic map layers are shown together , intersections in the overlay are positions of special ...
... Figure 2.1 . Using an overlay of the road map and the map storing cities you can now figure out how to get to the town . When two or more thematic map layers are shown together , intersections in the overlay are positions of special ...
Seite 26
... Figure 2.2 . Figure 2.2 An event point and the changes in the status structure T $ 3 $ 5 $ 1 $ 4 $ 3 $ 8 $ 7 S4 $ 3 $ 7 $ 5 $ 7 $ 5 $ 4 $ 1 $ 8 l 333 83 $ 2 $ 1 T $ 3 $ 2 $ 1 $ 8 $ 7 $ 7 $ 3 HANDLEEVENTPOINT ( p ) 1. Let U ( p ) be the ...
... Figure 2.2 . Figure 2.2 An event point and the changes in the status structure T $ 3 $ 5 $ 1 $ 4 $ 3 $ 8 $ 7 S4 $ 3 $ 7 $ 5 $ 7 $ 5 $ 4 $ 1 $ 8 l 333 83 $ 2 $ 1 T $ 3 $ 2 $ 1 $ 8 $ 7 $ 7 $ 3 HANDLEEVENTPOINT ( p ) 1. Let U ( p ) be the ...
Seite 29
... : they are subdivisions of the plane into labeled regions . A thematic map of forests in Canada , for instance , would be $ 5 $ 3 3333 $ 4 $ 2 29 Chapter 2 LINE SEGMENT INTERSECTION Figure 2.3 Types of forest The Doubly-Connected Edge List.
... : they are subdivisions of the plane into labeled regions . A thematic map of forests in Canada , for instance , would be $ 5 $ 3 3333 $ 4 $ 2 29 Chapter 2 LINE SEGMENT INTERSECTION Figure 2.3 Types of forest The Doubly-Connected Edge List.
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