On k-Nearest Neighbor Voronoi Diagrams in the Plane
From MaRDI portal
Publication:3953183
DOI10.1109/TC.1982.1676031zbMath0491.68062OpenAlexW2109067131MaRDI QIDQ3953183
Publication date: 1982
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1982.1676031
Related Items
2-point site Voronoi diagrams, Halfspace range search: An algorithmic application of k-sets, Higher order Delaunay triangulations, A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem, A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis, Voronoi diagrams over dynamic scenes, Edge-skeletons in arrangements with applications, A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids, On the \(k\)-colored rainbow sets in fixed dimensions, A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams, On selecting a fraction of leaves with disjoint neighborhoods in a plane tree, Optimal 2-coverage of a polygonal region in a sensor network, Algorithms for proximity problems in higher dimensions, A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams, An efficient randomized algorithm for higher-order abstract Voronoi diagrams, Compact location problems, Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks, The impact of heterogeneity and geometry on the proof complexity of random satisfiability, Compact location problems with budget and communication constraints, Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms, Dynamic data structures for \(k\)-nearest neighbor queries, Complexity and approximability of certain bicriteria location problems, Survivable minimum bottleneck networks, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, A simple algorithm for higher-order Delaunay mosaics and alpha shapes, Applications of generalized matrix searching to geometric algorithms, Minimum-sum dipolar spanning tree in \(\mathbb R^3\), Constructing minimum-interference networks, Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction, Higher order mobile coverage control with applications to clustering of discrete sets, Polynomial-reproducing spline spaces from fine zonotopal tilings, Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams, A new duality result concerning Voronoi diagrams, Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs, Computing closest and farthest points for a query segment, On the randomized construction of the Delaunay tree, Euclidean push--pull partial covering problems, Separation by convex pseudo-circles, The multi-cover persistence of Euclidean balls, Higher-order Voronoi diagrams on triangulated surfaces, Minimum-width annulus with outliers: circular, square, and rectangular cases, 2-Covered paths by a set of antennas with minimum power transmission range, Bivariate B-splines from convex configurations, Region-restricted clustering for geographic data mining, Depth of segments and circles through points enclosing many points: A note, On circles enclosing many points, Unnamed Item, Higher Order Voronoi Diagrams and Distance Functions in Art and Visualization, Testing the necklace condition for shortest tours and optimal factors in the plane, New applications of random sampling in computational geometry, On the number of line separations of a finite set in the plane, Computational geometry and the U.S. Supreme Court, Assigning weights to minimize the covering radius in the plane, The Multi-cover Persistence of Euclidean Balls, Poisson-Delaunay mosaics of order \(k\), A linear time algorithm for the bottleneck biconnected spanning subgraph problem, Delaunay configurations and multivariate splines: A generalization of a result of B. N. Delaunay, Order-k Voronoi diagrams of sites with additive weights in the plane, Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions, On levels in arrangements and Voronoi diagrams, The \(k\)-nearest-neighbor Voronoi diagram revisited, Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements, Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes, Structural tolerance and Delaunay triangulation, On the complexity of higher order abstract Voronoi diagrams, Approximation and complexity of the capacitated geometric median problem, Algebraic \(k\)-sets and generally neighborly embeddings, The higher-order Voronoi diagram of line segments
