Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms (Q1381794): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sorting helps for Voronoi diagrams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel geometric algorithms on a mesh-connected computer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Voronoi-like partition of lattice in cellular automata / rank | |||
Normal rank | |||
Revision as of 11:54, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms |
scientific article |
Statements
Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms (English)
0 references
1 November 1998
0 references
parallel algorithms
0 references
SIMD architectures
0 references
computational geometry
0 references
discrete space
0 references
Voronoi diagram
0 references
discrete lattice
0 references
algorithms
0 references
