Pages that link to "Item:Q846176"
From MaRDI portal
The following pages link to A fast robust algorithm for computing discrete Voronoi diagrams (Q846176):
Displaying 10 items.
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data (Q525736) (← links)
- Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms (Q1381794) (← links)
- Fast and accurate Voronoi density gridding from Lagrangian hydrodynamics data (Q1701286) (← links)
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models (Q2180624) (← links)
- A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations (Q2381920) (← links)
- Fast raster scan distance propagation on the discrete rectangular lattice (Q3136086) (← links)
- (Q3221723) (← links)
- Robust Point-Location in Generalized Voronoi Diagrams (Q3628374) (← links)
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS (Q4312278) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)
