Pages that link to "Item:Q2381920"
From MaRDI portal
The following pages link to A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920):
Displaying 4 items.
- A fast robust algorithm for computing discrete Voronoi diagrams (Q846176) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- An all-round sweep algorithm for 2-dimensional nearest-neighbor problems (Q1203723) (← links)
- An iterative algorithm for computing measures of generalized Voronoi regions (Q2875006) (← links)