Efficient Delaunay Tessellation through K-D Tree Decomposition Dmitriy Morozov

@inproceedings{Peterka2017EfficientDT,
  title={Efficient Delaunay Tessellation through K-D Tree Decomposition Dmitriy Morozov},
  author={Tom Peterka},
  year={2017}
}
Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly… CONTINUE READING