When constructing a Delaunay triangulation of a set of vertices via the point insertion algorithm, the algorithm performance is critically dependent on the ordering of the points inserted. Herein, two algorithms are described which build point quadtrees from the collection of vertices, then order those vertices via a space-filling curve before beginning point insertion. The quadtree algorithms are tested on both random and cartesian point meshes, and are compared to both unsorted and bin sorted point insertion.