Pages that link to "Item:Q4388891"

The following pages link to Constructing Levels in Arrangements and Higher Order Voronoi Diagrams (Q4388891):

Displaying 31 items.

• The higher-order Voronoi diagram of line segments (Q261375) (← links)
• A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
• On enclosing k points by a circle (Q674185) (← links)
• On levels in arrangements and Voronoi diagrams (Q804321) (← links)
• Region-restricted clustering for geographic data mining (Q1000925) (← links)
• Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
• Higher order mobile coverage control with applications to clustering of discrete sets (Q1737771) (← links)
• An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
• On geometric optimization with few violated constraints (Q1906043) (← links)
• The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
• The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
• Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
• On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
• Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
• Computing closest and farthest points for a query segment (Q2481974) (← links)
• Euclidean push--pull partial covering problems (Q2496058) (← links)
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
• Multi Cover of a Polygon Minimizing the Sum of Areas (Q3078391) (← links)
• Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• CENTROID TRIANGULATIONS FROM k-SETS (Q4650084) (← links)
• MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS (Q4650087) (← links)
• Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
• Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms (Q6090986) (← links)
• Bottleneck matching in the plane (Q6103175) (← links)
• Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)