An optimal algorithm for constructing the weighted Voronoi diagram in the plane
From MaRDI portal
Publication:793982
DOI10.1016/0031-3203(84)90064-5zbMATH Open0539.52008OpenAlexW2001099600MaRDI QIDQ793982FDOQ793982
Authors: 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
Recommendations
Cites Work
Cited In (75)
- Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets
- Connecting red cells in a bicolour Voronoi diagram
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
- An analytical representation of the 2d generalized balanced power diagram
- 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
- SYMMETRY OF FLOW DIAGRAMS DERIVED FROM WEIGHTED POINTS IN THE PLANE
- The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
- Title not available (Why is that?)
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications (extended abstract)
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- Linear expected complexity for directional and multiplicative Voronoi diagrams
- Large-\(n\) conditional facedness \(m_n\) of 3D Poisson-Voronoi cells
- Sensitivity analysis and tailored design of minimization diagrams
- Power Diagrams: Properties, Algorithms and Applications
- A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
- The predicates of the Apollonius diagram: algorithmic analysis and implementation
- On bisectors for different distance functions
- MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS
- Competitive spatial models
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- The embracing Voronoi diagram and closest embracing number
- Planar expropriation problem with non-rigid rectangular facilities
- Voronoi Diagram in the Laguerre Geometry and Its Applications
- Order-k Voronoi diagrams of sites with additive weights in the plane
- Farthest line segment Voronoi diagrams
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Tailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagnetics
- Abstract Voronoi diagrams from closed bisecting curves
- Title not available (Why is that?)
- Voronoi diagrams and arrangements
- Weighted Voronoi region algorithms for political districting
- Finding constrained and weighted Voronoi diagrams in the plane
- The weighted farthest color Voronoi diagram on trees and graphs.
- A surface remeshing approach
- Voronoi diagrams with overlapping regions
- Stable marker-particle method for the Voronoi diagram in a flow field
- Solving the \(k\)-influence region problem with the GPU
- On the construction of abstract Voronoi diagrams
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A sweepline algorithm for Voronoi diagrams
- Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
- Title not available (Why is that?)
- Algorithms – ESA 2005
- Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Fast Voronoi modeling
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
- Kinetic collision detection for convex fat objects
- Voronoi diagrams over dynamic scenes
- Voronoi diagram with visual restriction
- On clustering induced Voronoi diagrams
- Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
- Region-expansion for the Voronoi diagram of 3D spheres
- A workbench for computational geometry
- BOAT-SAIL VORONOI DIAGRAM AND ITS APPLICATION
- Optimal evasive strategies for multiple interacting agents with motion constraints
- Voronoi diagrams and Delaunay triangulations
- Political districting: From classical models to recent approaches
- An Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi Diagrams
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Political districting: from classical models to recent approaches
- Coresets for the Nearest-Neighbor Rule
- On determining optimal strategies in pursuit games in the plane
- On the circles of Apollonius associated with a triangle
- Fuzzy Voronoi Diagram
- Multiple covers with balls. II: Weighted averages
- Generalized Voronoi tessellation as a model of two-dimensional cell tissue dynamics
- The one-dimensional weighted Voronoi diagram
- Shapes of Delaunay Simplexes and Structural Analysis of Hard Sphere Packings
- A parallel algorithm based on convexity for the computing of Delaunay tessellation
- Weighted Voronoi diagrams in the maximum norm
- Manifold reconstruction using tangential Delaunay complexes
- On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs
- On the complexity of randomly weighted multiplicative Voronoi diagrams
This page was built for publication: An optimal algorithm for constructing the weighted Voronoi diagram in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793982)
