Craig Taverner, a Senior Software Engineer at Neo4j, presented "Building Spatial Search Algorithms" at NODES 2019. The presentation focused on the two new data types introduced in Neo4j 3.4: temporal and spatial. The talk covered the history of Neo4j's work in spatial algorithms, including its recent internship with Eindhoven University student Stef van der Linde. Taverner discussed how the task given to van der Linde was to develop complex algorithms for spatial graph data, which led to some interesting conclusions about the performance of different data models. The presentation then delved into specific spatial algorithms, including route finding using Dijkstra's algorithm and A* search, point-in-polygon, polygon area calculation, intersection detection, distance calculation, and convex hull generation. Taverner also demonstrated how these algorithms can be used in a full-stack application to solve real-world problems. The talk highlighted the importance of speed and performance when it comes to choosing data models and writing complicated algorithms.