Computational Geometry课件.pptVIP

Computational Geometry;Our First Problem ;Similarity Measure;Similarity Measure;Similarity measure;The dimension;Question;Question;Answers? ;Answers? ;NN search;NN Searching : Balanced binary tree;K-nearest neighbor search;Fixed NN Search;Brute Force implementation;Fixed NN Search: By Sorting;Total work done after sorting;Total work done after sorting;Fixed radius near neighbor searching;Solution using bucketing;Solution using bucketing;The Algorithm;Running Time;Observation;Running Time;Higher Dimensions;Introduction: Geometry Basics;Vector Space;Vector Space;Affine Geometry;Affine Geometry;Affine Geometry;Affine Combinations;Euclidean Geometry;Example of Inner Products;Dot products;Some proofs using Dot Products;Homework: (Programming) Play with dpoint.hpp and example.cpp (Implement orientation in d-D). Implement your own dvector.hpp, dsegment.hpp using metaprogramming Make sure you understand how things work. ;Crash course on C++“dpoint.hpp”;Object Oriented Programming;Class membership;Inheritance;Templates;Generic Programming;Templates;Metaprogramming;Good old C;Templates;Function Templates;Function Templates;Function Template Specialization;Class Templates;Class Templates: Unlike function templates;Using Specializations;Template Template Parameters;Recall C Enumerations;More Templates;Template Metaprograms;Template Metaprograms;Template Metaprograms;Food for thought;Traits Technique;Traits;Traits;Traits;Sources ;GNU MP;Orientation primitive for points;Orientation;Homeworks;Problems with fixed point arithmetic;Exaggerating the error;Determinant;Floating point computation;Convexity;Convex hulls