Parallel computation of discrete Voronoi diagrams (Q5096154): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Triangle cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Movement Techniques for the Pyramid Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh-Connected Computers with Broadcasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pyramid computer solutions of the closest pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank

Latest revision as of 21:15, 29 July 2024

scientific article; zbMATH DE number 7571927
Language Label Description Also known as
English
Parallel computation of discrete Voronoi diagrams
scientific article; zbMATH DE number 7571927

    Statements

    Parallel computation of discrete Voronoi diagrams (English)
    0 references
    0 references
    16 August 2022
    0 references
    Voronoi diagram
    0 references
    Delaunay triangulation
    0 references
    Voronoi cell
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references