Sorting helps for Voronoi diagrams
type: Item
instance of: scholarly article
title: Sorting helps for Voronoi diagrams
zbMATH Open document ID: 0868.68109
DOI: 10.1007/BF02526034
published in: Algorithmica
publication date: 1997-01-01T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1014216
zbMATH Keywords: Delaunay triangulations
zbMATH Keywords: Voronoi diagrams
zbMATH Keywords: convex distance function
author: L. Paul Chew
author: Steven Fortune
MaRDI profile type: Publication
cites work: There are planar graphs almost as good as the complete graph
cites work: Finding Minimum Spanning Trees
cites work: A sweepline algorithm for Voronoi diagrams
cites work: A priority queue in which initialization and queue operations takeO(loglogD) time
cites work: Two-Dimensional Voronoi Diagrams in the L p -Metric
cites work: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
cites work: Q3694703
cites work: Q3716336
cites work: Design and implementation of an efficient priority queue
cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
description: scientific article; zbMATH DE number 1014216