IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
From MaRDI portal
Publication:3219793
DOI10.15807/jorsj.27.306zbMath0556.68039MaRDI QIDQ3219793
Kazuo Murota, Masao Iri, Takao Ohya
Publication date: 1984
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/da845706e6520cb5f643c24b26f5f12fa64fe6ba
05B45: Combinatorial aspects of tessellation and tiling problems
68R99: Discrete mathematics in relation to computer science
Related Items
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments, Why is the 3D Delaunay triangulation difficult to construct?, Solving scheduling and location problems in the plane simultaneously, Two design principles of geometric algorithms in finite-precision arithmetic, Equitable service by a facility: minimizing the Gini coefficient, Location of a facility minimizing nuisance to or from a planar network, Optimizing the location of a production firm, A general global optimization approach for solving location problems in the plane, Location with acceleration-deceleration distance, Constructing a DC decomposition for ordered median problems, A faster divide-and-conquer algorithm for constructing Delaunay triangulations, A sweepline algorithm for Voronoi diagrams, Computing correct Delaunay triangulations, A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case, New primal and dual matching heuristics, The minimum equitable radius location problem with continuous demand, Solving the ordered one-median problem in the plane, Fast computing of three-dimensional convex hulls using graphics hardware, A comparison of sequential Delaunay triangulation algorithms., A note on equity across groups in facility location, A stochastic gradual cover location problem
