Optimal computation of the Voronoi diagram of disjoint clusters

DOI10.1016/S0020-0190(00)00179-4zbMath1032.68147OpenAlexW1973048902MaRDI QIDQ1603454

Xue-Hou Tan

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00179-4

zbMATH Keywords

Computational geometryClusters of pointsFurthest-site Voronoi diagramsVoronoi diagrams of disjoint clusters

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

The L∞ Hausdorff Voronoi Diagram Revisited

Cites Work

• The upper envelope of piecewise linear functions: Algorithms and applications
• A sweepline algorithm for Voronoi diagrams
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal computation of the Voronoi diagram of disjoint clusters