Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms

DOI10.1016/S0895-7177(97)00145-3zbMath0898.65110OpenAlexW2074942145WikidataQ57001234 ScholiaQ57001234MaRDI QIDQ1381794

Boleslaw K. Szymanski, William Maniatty

Publication date: 1 November 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00145-3

zbMATH Keywords

algorithmsparallel algorithmsVoronoi diagramcomputational geometrydiscrete spacediscrete latticeSIMD architectures

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

THE FORMATION OF VORONOI DIAGRAMS IN CHEMICAL AND PHYSICAL SYSTEMS: EXPERIMENTAL FINDINGS AND THEORETICAL MODELS ⋮ Voronoi-like nondeterministic partition of a lattice by collectives of finite automata

Cites Work

• Unnamed Item
• Sorting helps for Voronoi diagrams
• Parallel geometric algorithms on a mesh-connected computer
• Voronoi-like partition of lattice in cellular automata

This page was built for publication: Fine-grain discrete Voronoi diagram algorithms in \(L_1\) and \(L_\infty\) norms