Pages that link to "Item:Q804321"

The following pages link to On levels in arrangements and Voronoi diagrams (Q804321):

Displaying 23 items.

• Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
• Arrangements of oriented hyperplanes (Q1312195) (← links)
• Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
• \(k\)-violation linear programming (Q1336744) (← links)
• An introduction to randomization in computational geometry (Q1351693) (← links)
• On the total weight of arrangements of halfplanes (Q1801629) (← links)
• Dynamic half-space range reporting and its applications (Q1891228) (← links)
• On geometric optimization with few violated constraints (Q1906043) (← links)
• Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
• On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
• On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
• A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
• Levelness of Order Polytopes (Q3300753) (← links)
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams (Q4388891) (← links)
• (Q4504033) (← links)
• Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
• (Q5088995) (← links)
• The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
• The edge labeling of higher order Voronoi diagrams (Q6618154) (← links)
• Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions (Q6624198) (← links)