IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS

DOI10.15807/JORSJ.27.306MaRDI QIDQ3219793zbMATH OpenOpenAlexFDO

Authors Takao Ohya, Masao Iri, Kazuo Murota

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

zbMATH Keywords

fast algorithmcomputational geometryperformance evaluationVoronoi diagram

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Combinatorial aspects of tessellation and tiling problems (05B45)

Recommendations

• Randomized incremental construction of Delaunay and Voronoi diagrams
• scientific article; zbMATH DE number 4098181
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• scientific article; zbMATH DE number 177830
• Primitives for the manipulation of general subdivisions and the computation of Voronoi

Cited in

(37)

• The planar multifacility collection depots location problem
• A stochastic gradual cover location problem
• A note on equity across groups in facility location
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Gradual cover competitive facility location
• Optimizing the location of a production firm
• The obnoxious facilities planar \(p\)-median problem
• Covering part of a planar network
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
• Location of a distribution center for a perishable product
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• A sweepline algorithm for Voronoi diagrams
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Equitable service by a facility: minimizing the Gini coefficient
• Location of a facility minimizing nuisance to or from a planar network
• Constructing a DC decomposition for ordered median problems
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
• A comparison of sequential Delaunay triangulation algorithms.
• Fast computing of three-dimensional convex hulls using graphics hardware
• New local searches for solving the multi-source Weber problem
• TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM
• A straightforward iterative algorithm for the planar Voronoi diagram
• VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
• Location with acceleration-deceleration distance
• A general global optimization approach for solving location problems in the plane
• Incremental Voronoi diagrams
• Two design principles of geometric algorithms in finite-precision arithmetic
• The minimum equitable radius location problem with continuous demand
• Solving the ordered one-median problem in the plane
• Fitting concentric circles to measurements
• Voronoi diagram generation algorithm based on Delaunay triangulation
• Maximizing the minimum cover probability by emergency facilities
• Computing correct Delaunay triangulations
• Solving scheduling and location problems in the plane simultaneously
• New primal and dual matching heuristics
• Why is the 3D Delaunay triangulation difficult to construct?
• \textit{OFC}-Delaunay triangulation: a new efficient algorithm for merging two adjacent Delaunay triangulations

This page was built for publication: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219793)