Design and analysis of algorithms for solving geometrical problems; includes convex hull problems, Voronoi diagrams, range searching and proximity problems. or approval of instructor. Cross Listing: CSCE 620/VIZA 670 Credits 3. 3 Lecture Hours.
Design and analysis of algorithms for solving geometrical problems; includes convex hull problems, Voronoi diagrams, range searching and proximity problems. or approval of instructor. Cross Listing: CSCE 620/VIZA 670 Credits 3. 3 Lecture Hours.
