The complexity of finding minimal Voronoi covers with applications to machine learning
type: Item
instance of: scholarly article
title: The complexity of finding minimal Voronoi covers with applications to machine learning
zbMATH Open document ID: 0801.68166
DOI: 10.1016/0925-7721(93)90019-3
author: David G. Heath
author: Simon Kasif
published in: Computational Geometry
publication date: 1994-11-29T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 503006
zbMATH Keywords: Voronoi diagrams
zbMATH Keywords: computational geometry
zbMATH Keywords: machine learning
zbMATH Keywords: NP-hard
zbMATH Keywords: training
zbMATH Keywords: nearest neighbor learning program
zbMATH Keywords: planar tessellation
MaRDI profile type: Publication
full work available at URL: 0925-7721(93)90019-3
OpenAlex ID: W2084691280
cites work: Recognizing Dirichlet tesselations
cites work: Efficient Planarity Testing
cites work: Planar Formulae and Their Uses
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q3992847
cites work: Q4013738
cites work: APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
description: scientific article; zbMATH DE number 503006