Pages that link to "Item:Q804320"

The following pages link to Higher-dimensional Voronoi diagrams in linear expected time (Q804320):

Displaying 34 items.

• A faster circle-sweep Delaunay triangulation algorithm (Q427141) (← links)
• Voronoi diagrams of random lines and flats (Q677015) (← links)
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• Moment preserving constrained resampling with applications to particle-in-cell methods (Q778280) (← links)
• Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
• On the randomized construction of the Delaunay tree (Q1210297) (← links)
• The expected number of \(k\)-faces of a Voronoi diagram (Q1309732) (← links)
• Complexity of the Delaunay triangulation of points on polyhedral surfaces (Q1434252) (← links)
• A space-time adaptive method for reservoir flows: formulation and one-dimensional application (Q1710296) (← links)
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
• On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689) (← links)
• Incremental topological flipping works for regular triangulations (Q1908263) (← links)
• Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
• Persistent homology in \(\ell_\infty\) metric (Q2064022) (← links)
• A boundary-partition-based Voronoi diagram of \(d\)-dimensional balls: definition, properties, and applications (Q2178837) (← links)
• Fast multivariate log-concave density estimation (Q2337320) (← links)
• A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
• A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
• Node-based parallel computing of three-dimensional incompressible flows using the free mesh method (Q2486499) (← links)
• A simple algorithm for higher-order Delaunay mosaics and alpha shapes (Q2700389) (← links)
• On Some Proximity Problems of Colored Sets (Q2867120) (← links)
• The Morse theory of Čech and Delaunay complexes (Q2960445) (← links)
• THE DELAUNAY HIERARCHY (Q3021945) (← links)
• 3/4-Discrete Optimal Transport (Q3303986) (← links)
• A Robust Implementation for Three-Dimensional Delaunay Triangulations (Q4513210) (← links)
• PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS (Q4818540) (← links)
• (Q5075759) (← links)
• (Q5111687) (← links)
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
• A FEM-BASED MESHFREE METHOD WITH A PROBABILISTIC NODE GENERATION TECHNIQUE (Q5695051) (← links)
• Convergence of Anisotropic Mesh Adaptation via Metric Optimization (Q5864680) (← links)
• The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)