Performance analysis of morphological Voronoi tessellation algorithms

MaRDI QIDQ4225240zbMATH OpenFDO

Authors Ioannis Pitas

Publication date 22 April 1999

zbMATH Keywords

Voronoi tessellation procedure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• 3-D Voronoi tessellation algorithms
• A new parallel algorithm for constructing Voronoi tessellations from distributed input data
• A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
• scientific article; zbMATH DE number 1079755

Cited in

(6)

• A nearest neighbor sweep circle algorithm for computing discrete Voronoi tessellations
• 3-D Voronoi tessellation algorithms
• Tessellations by connection
• Computing Voronoi adjacencies in high dimensional spaces by using linear programming
• Eikonal-based models of random tessellations
• A new parallel algorithm for constructing Voronoi tessellations from distributed input data

This page was built for publication: Performance analysis of morphological Voronoi tessellation algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225240)