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.68039OpenAlexW2733827376MaRDI 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
Combinatorial aspects of tessellation and tiling problems (05B45) Discrete mathematics in relation to computer science (68R99)
Related Items (31)
A note on equity across groups in facility location ⋮ Equitable service by a facility: minimizing the Gini coefficient ⋮ Covering part of a planar network ⋮ The planar multifacility collection depots location problem ⋮ New primal and dual matching heuristics ⋮ A faster divide-and-conquer algorithm for constructing Delaunay triangulations ⋮ The minimum equitable radius location problem with continuous demand ⋮ Solving the ordered one-median problem in the plane ⋮ Location of a distribution center for a perishable product ⋮ A sweepline algorithm for Voronoi diagrams ⋮ Fast computing of three-dimensional convex hulls using graphics hardware ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Gradual cover competitive facility location ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ Fitting concentric circles to measurements ⋮ Computing correct Delaunay triangulations ⋮ Why is the 3D Delaunay triangulation difficult to construct? ⋮ A stochastic gradual cover location problem ⋮ Location of a facility minimizing nuisance to or from a planar network ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ New local searches for solving the multi-source Weber problem ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ A comparison of sequential Delaunay triangulation algorithms. ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ Optimizing the location of a production firm ⋮ A general global optimization approach for solving location problems in the plane ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ Two design principles of geometric algorithms in finite-precision arithmetic ⋮ Location with acceleration-deceleration distance ⋮ Constructing a DC decomposition for ordered median problems ⋮ A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
This page was built for publication: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
