Voronoi diagrams from convex hulls
type: Item
instance of: scholarly article
title: Voronoi diagrams from convex hulls
zbMATH Open document ID: 0424.68036
DOI: 10.1016/0020-0190(79)90074-7
author: Kevin Q. Brown
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 52A10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52A20
zbMATH DE Number: 3660800
zbMATH Keywords: computational geometry
zbMATH Keywords: convex hull
zbMATH Keywords: algorithm for constructing a planar Euclidean Voronoi
zbMATH Keywords: K-dimensional Euclidean Voronoi diagram
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90074-7
OpenAlex ID: W1984406695
Wikidata QID: Q56070313
cites work: Divide and conquer for linear expected time
cites work: An Algorithm for Convex Polytopes
cites work: A New Convex Hull Algorithm for Planar Sets
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: Q5547252
cites work: Parallel concepts in graph theory
cites work: Printer graphics for clustering
cites work: Location of a Point in a Planar Subdivision and Its Applications
cites work: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
cites work: Q3206972
cites work: Convex hulls of finite sets of points in two and three dimensions
cites work: Finding the intersection of n half-spaces in time O(n log n)
cites work: Q4133127
DBLP publication ID: journals/ipl/Brown79a
description: scientific article; zbMATH DE number 3660800