Description:

Algorithms are at the heart of Computer Science and they have a very real practical impact for Software Engineers. Too often, textbooks and Internet resources contain just the final code that implements an algorithm without any explanation or guidelines on how it was designed and implemented. In this webcast, I will demonstrate the principles behind kd-trees and how they can be used to solve a number of interesting problems, such as nearest neighbor and range queries. I will implement a GUI-based application that draws the kd-tree as points are inserted and performs range queries.

About George Heineman

George Heineman is an associate professor of computer science at Worcester Polytechnic Institute. His research interests are in software engineering. He co-edited the 2001 book Component-Based Software Engineering: Putting the Pieces Together (Addison-Wesley) and is co-author of Algorithms In A Nutshell by O'Reilly. The second edition of this book will be published in November 2015. Aside from his professional pursuits, George is an avid puzzler. He invented Sujiken®, a Sudoku variation played on a right-triangle arrangement of cells in which numbers cannot repeat in a horizontal row, vertical column or diagonal in any direction. Books published include Sudoku on the Half Shell: 150 Addictive Sujiken® Puzzles (Puzzlewright Press, 2011).

Website: https://web.cs.wpi.edu/~heineman/