Optimal computation of the Voronoi diagram of disjoint clusters
type: Item
instance of: scholarly article
title: Optimal computation of the Voronoi diagram of disjoint clusters
zbMATH Open document ID: 1032.68147
DOI: 10.1016/S0020-0190(00)00179-4
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1767342
zbMATH Keywords: Computational geometry
zbMATH Keywords: Voronoi diagrams of disjoint clusters
zbMATH Keywords: Furthest-site Voronoi diagrams
zbMATH Keywords: Clusters of points
author: Xuehou Tan
MaRDI profile type: Publication
cites work: The upper envelope of piecewise linear functions: Algorithms and applications
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Q4875212
cites work: Q3992847
full work available at URL: s0020-0190(00)00179-4
OpenAlex ID: W1973048902
Recommended article: An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
Recommended article: An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
Recommended article: On Clustering Induced Voronoi Diagrams
Recommended article: A nearly optimal deterministic parallel Voronoi diagram algorithm
Recommended article: A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
Recommended article: Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane
Recommended article: Parallel computation of discrete Voronoi diagrams
Recommended article: ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
Recommended article: Q5088939
description: scientific article; zbMATH DE number 1767342