Introduction to Parallel Computing ….ppt

Algorithms and Modern Computer Science My Research Interests Computer modeling and simulation Computational geometry Image processing Visualization Voronoi diagram and Delaunay triangulation Biometric technologies Collision detection optimization Terrain modeling and visualization Exact computation Computational methods in spatial analysis and GIS Affiliations Co-Founder, Biometric Technologies Laboratory, sponsored by CFI Grant, ES 221 Co-Founder, SPARCS Laboratory for Spatial Analysis and Computational Science, sponsored by GEOIDE, ICT 7th floor Data Structures to be Studied Hashing and hash tables Trees Spatial subdivisions Graphs Flow networks Geometric data structures Algorithms to be studies Search heuristics Encoding and compression techniques Linear programming Dynamic programming Game design techniques Randomized algorithms Long-Term Goals of Research in Computer Science Provide a solution to a problem Decrease possibility of an error Improve methodology or invent a novel solution Make solution more robust Make solution more efficient Make solution less memory consuming Examples of data structures applications in areas of computer science Typical applications: Heaps for data ordering and faster access in operating systems K-d trees for multi-dimensional database searches B, B*, B+ trees for file accesses Geometric data structures for geographical data representation and processing Compression algorithms for remote access, Internet, network transmission and security Search heuristics for game strategy implementation More Advanced Applications Data structures in Optimization and Computer Simulation Data structures in Image Processing and Computer Graphics Data structures in GIS (Geographical Information Systems) and statistical analysis Data structures in biometrics Part 1. Optimization and Computer Modeling Space partitioning Trees Geometric data structures Pool of Data Structures Collision detection optimization Problem: A set of n moving pa