An optimal algorithm for constructing the weighted Voronoi diagram in the plane

From MaRDI portal
Revision as of 11:05, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (56)

Voronoi diagrams and arrangementsVoronoi diagrams over dynamic scenesTailoring unstructured meshes for use with a 3D time domain co-volume algorithm for computational electromagneticsBatched Point Location in SINR Diagrams via Algebraic ToolsSolving the \(k\)-influence region problem with the GPUAn O(n log n) algorithm for the Voronoi diagram of a set of simple curve segmentsFarthest line segment Voronoi diagramsA sweepline algorithm for Voronoi diagramsWeighted Voronoi region algorithms for political districtingVoronoi diagrams with overlapping regionsPolitical districting: from classical models to recent approachesCompetitive spatial modelsOn the geodesic Voronoi diagram of point sites in a simple polygonMinimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid MotionsA POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEMStable marker-particle method for the Voronoi diagram in a flow fieldAn \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)Fast Voronoi modelingGeneralized Voronoi tessellation as a model of two-dimensional cell tissue dynamicsFinding constrained and weighted Voronoi diagrams in the planeThe impact of heterogeneity and geometry on the proof complexity of random satisfiabilityMinimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motionsSensitivity analysis and tailored design of minimization diagramsUnnamed ItemManifold reconstruction using tangential Delaunay complexesThe weighted farthest color Voronoi diagram on trees and graphs.Voronoi diagram with visual restrictionPolitical districting: From classical models to recent approachesA parallel algorithm based on convexity for the computing of Delaunay tessellationCoresets for the Nearest-Neighbor RuleAn Efficient, Practical Algorithm and Implementation for Computing Multiplicatively Weighted Voronoi DiagramsLarge-nconditional facednessmnof 3D Poisson–Voronoi cellsConnecting Red Cells in a Bicolour Voronoi DiagramTHE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONSA surface remeshing approachOn the circles of Apollonius associated with a triangleOn bisectors for different distance functionsPlanar expropriation problem with non-rigid rectangular facilitiesOptimal evasive strategies for multiple interacting agents with motion constraintsNonuniform SINR+Voronoi diagrams are effectively uniformShapes of Delaunay Simplexes and Structural Analysis of Hard Sphere PackingsFuzzy Voronoi DiagramKinetic collision detection for convex fat objectsOn determining optimal strategies in pursuit games in the planeOn the construction of abstract Voronoi diagramsBOAT-SAIL VORONOI DIAGRAM AND ITS APPLICATIONWeighted Voronoi Diagrams in the Maximum NormMULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDSOn the recognition and reconstruction of weighted Voronoi diagrams and bisector graphsAbstract Voronoi Diagrams from Closed Bisecting CurvesBoat-sail Voronoi diagram and its computation based on a cone-approximation schemeOrder-k Voronoi diagrams of sites with additive weights in the planeOPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONSOn the complexity of randomly weighted multiplicative Voronoi diagramsThe one-dimensional weighted Voronoi diagramA workbench for computational geometry




Cites Work




This page was built for publication: An optimal algorithm for constructing the weighted Voronoi diagram in the plane