An optimal algorithm for constructing the weighted Voronoi diagram in the plane
From MaRDI portal
Publication:793982
DOI10.1016/0031-3203(84)90064-5zbMath0539.52008OpenAlexW2001099600MaRDI QIDQ793982
Franz Aurenhammer, Herbert Edelsbrunner
Publication date: 1984
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-3203(84)90064-5
Related Items
Voronoi diagrams and arrangements, Voronoi diagrams over dynamic scenes, Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics, Batched Point Location in SINR Diagrams via Algebraic Tools, Solving the \(k\)-influence region problem with the GPU, An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments, Farthest line segment Voronoi diagrams, A sweepline algorithm for Voronoi diagrams, Weighted Voronoi region algorithms for political districting, Voronoi diagrams with overlapping regions, Political districting: from classical models to recent approaches, Competitive spatial models, On the geodesic Voronoi diagram of point sites in a simple polygon, Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions, A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM, Stable marker-particle method for the Voronoi diagram in a flow field, An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\), Fast Voronoi modeling, Generalized Voronoi tessellation as a model of two-dimensional cell tissue dynamics, Finding constrained and weighted Voronoi diagrams in the plane, The impact of heterogeneity and geometry on the proof complexity of random satisfiability, Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions, Sensitivity analysis and tailored design of minimization diagrams, Unnamed Item, Manifold reconstruction using tangential Delaunay complexes, The weighted farthest color Voronoi diagram on trees and graphs., Voronoi diagram with visual restriction, Political districting: From classical models to recent approaches, A parallel algorithm based on convexity for the computing of Delaunay tessellation, Coresets for the Nearest-Neighbor Rule, An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams, Large-nconditional facednessmnof 3D Poisson–Voronoi cells, Connecting Red Cells in a Bicolour Voronoi Diagram, THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS, A surface remeshing approach, On the circles of Apollonius associated with a triangle, On bisectors for different distance functions, Planar expropriation problem with non-rigid rectangular facilities, Optimal evasive strategies for multiple interacting agents with motion constraints, Nonuniform SINR+Voronoi diagrams are effectively uniform, Shapes of Delaunay Simplexes and Structural Analysis of Hard Sphere Packings, Fuzzy Voronoi Diagram, Kinetic collision detection for convex fat objects, On determining optimal strategies in pursuit games in the plane, On the construction of abstract Voronoi diagrams, BOAT-SAIL VORONOI DIAGRAM AND ITS APPLICATION, Weighted Voronoi Diagrams in the Maximum Norm, MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS, On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs, Abstract Voronoi Diagrams from Closed Bisecting Curves, Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme, Order-k Voronoi diagrams of sites with additive weights in the plane, OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS, On the complexity of randomly weighted multiplicative Voronoi diagrams, The one-dimensional weighted Voronoi diagram, A workbench for computational geometry
Cites Work
