Publication:3796756
From MaRDI portal
zbMath0651.68064MaRDI QIDQ3796756
Publication date: 1988
quadtree; computational geometry; Delaunay triangulation; divide-and-conquer algorithm; cell techniques
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
Related Items
The stochastic walk algorithms for point location in pseudo-triangulations, The maximum opposite angulation for mesh construction, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, A comparison of sequential Delaunay triangulation algorithms.