Pages that link to "Item:Q1820582"

The following pages link to New applications of random sampling in computational geometry (Q1820582):

Displaying 26 items.

• A subexponential bound for linear programming (Q1923862) (← links)
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
• Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
• Random sampling with removal (Q2207595) (← links)
• Streaming algorithms for extent problems in high dimensions (Q2345940) (← links)
• The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
• On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
• Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
• Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
• Fast segment insertion and incremental construction of constrained Delaunay triangulations (Q2354921) (← links)
• A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
• Ray shooting on triangles in 3-space (Q2366231) (← links)
• A note on point location in arrangements of hyperplanes (Q2390231) (← links)
• An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
• A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
• Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
• Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
• An algorithm for generalized point location and its applications (Q2639635) (← links)
• IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
• A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams (Q2942610) (← links)
• Spanning trees with low crossing number (Q3358265) (← links)
• On the number of regular vertices of the union of Jordan regions (Q5054868) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Separating and shattering long line segments (Q6487423) (← links)