 |
|
Was andere dazu sagen - Rezension schreibenBewertungen von Nutzern
Review: Computational Geometry: Algorithms and ApplicationsNutzerbericht - Lucy - GoodreadsRead enough for an exam, great book. Vollständige Rezension lesen Review: Computational Geometry: Algorithms and ApplicationsNutzerbericht - Willy Van den driessche - GoodreadsBeauty is the first test. This is a very beautiful book (form) with a beautiful contents. The book explains in a very throrough way some of the fundamental algoritms in "computational geometry". You ... Vollständige Rezension lesen Ähnliche Bücher
Inhalt
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen3-dimensional associated structure beach line bound boundary BSP tree canonical subsets Chapter complexity computational geometry configuration space construct contains convex hull convex polygon corresponding data structure defined Delaunay triangulation denote diagonal disc doubly-connected edge list endpoint event point face facets Figure geometric graph half-edge half-planes Hence input interior intersection point interval tree kd-tree leaf Lemma lies LINE SEGMENT INTERSECTION line segments linear program mesh Minkowski sum motion planning Notes and Comments number of reported O(logn O(n\ogn objects obstacles partition tree planar plane sweep point location point q 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 INTERSECTION segment tree set of points shortest path simple polygon square subdivision subtree sweep line Theorem total number trapezoidal map triangles v-coordinate vertex visibility graph Vor(P Voronoi diagram Beliebte PassagenSeite 356 - Halperin, and MH Overmars. The complexity of the free space for a robot moving amidst fat obstacles. Comput. Geom. Theory Appl., 3:353-373, 1993. Seite 345 - Y.-J. Chiang, FP Preparata, and R. Tamassia. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. Seite 343 - J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Seite 354 - M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Seite 353 - MH Overmars and J. van Leeuwen. Dynamization of decomposable searching problems yielding good worst-case bounds. Seite 357 - New Heuristic Algorithms for Efficient Hierarchical Path Planning", IEEE Trans. On Robotics and Automation, 7(1), 9-19, 1991. Verweise auf dieses BuchAus anderen Büchern
Aus Google ScholarXR-Tree: Indexing XML Data for Efficient Structural JoinsHaifeng Jiang, Hongjun Lu, Wei Wang, Beng Chin Ooi An Efficient Color Representation for Image RetrievalYining Deng, BS Manjunath, Charles Kenney, Michael S Moore, Hyundoo Shin - 2001 - IEEE TRANSACTIONS ON IMAGE PROCESSING Reverse kNN Search in Arbitrary DimensionalityYufei Tao, Dimitris Papadias, Xiang Lian A new segmentation method for point cloud dataH Woo, E Kang, Semyung Wang, Kwan H Lee - 2002 - International Journal of Machine Tools and Manufacture Referenzen von WebseitenComputational Geometry, Algorithms and Applications JSTOR: Computational Geometry: Algorithms and Applications cse788-winter07 www.HCW.be : Computational Geometry - Algorithms and Applications ... Computational geometry : algorithms and applications avaxhome -> ebooks -> Science -> Mathematics -> Computational ... De Айсберг, фургон Kreveld, сверхмарс, Schwarzkopf. Вычислительная ... Themenliste de Berg, van Kreveld, Overmars, Schwarzkopf. Computational ... Computational Geometry: Algorithms and Applications Bibliografische Informationen
|