Pages that link to "Item:Q1125808"
From MaRDI portal
The following pages link to Design and implementation of a practical parallel Delaunay algorithm (Q1125808):
Displayed 10 items.
- Recent advances in parallel advancing front grid generation (Q346234) (← links)
- A new parallel algorithm for constructing Voronoi tessellations from distributed input data (Q525736) (← links)
- A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607) (← links)
- Parallel Delaunay triangulation in three dimensions (Q695951) (← links)
- Parallel geometric algorithms for multi-core computers (Q991179) (← links)
- A sweep-line algorithm for spatial clustering (Q1009933) (← links)
- (Q3391377) (← links)
- PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES (Q3430330) (← links)
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS (Q4676179) (← links)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)