Fuetterling, ValentinLojewski, CarstenPfreundt, Franz-JosefIngo Wald and Jonathan Ragan-Kelley2015-07-062015-07-062014978-3-905674-60-62079-8679https://doi.org/10.2312/hpg.20141098https://diglib.eg.org:443/handle/10.2312/hpg.20141098We present an efficient implementation of a Dwyer-style Delaunay triangulation algorithm that runs in O(N) expected time. An implicit quad-tree is constructed directly from the floating point bit patterns of the input points by sorting the corresponding Morton codes with a radix sorting procedure. This unique structure adapts elegantly to any (non-)uniform distribution of input points and increases the accuracy of the merging calculations by grouping floating point values with similar bit patterns. Our implementation allows for easy parallelization and we demonstrate a record construction speed of one Billion Delaunay triangles in just 8s on a many-core SMP machine.I.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithms