Pages that link to "Item:Q1401886"

The following pages link to DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886):

Displaying 23 items.

• DeWall (Q14393) (← links)
• Design of computer experiments: space filling and beyond (Q693293) (← links)
• RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point (Q746340) (← links)
• The Delaunay triangulation learner and its ensembles (Q830534) (← links)
• Feature-based multiresolution techniques for product design (Q863832) (← links)
• Mesh simplification using an area-based distortion measure (Q864939) (← links)
• Optimal Lagrange interpolation by quartic \(C^1\) splines on triangulations (Q929937) (← links)
• Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets (Q967409) (← links)
• A model to simplify 2D triangle meshes with irregular shapes (Q984322) (← links)
• TRIOPT: A triangulation-based partitioning algorithm for global optimization (Q1763759) (← links)
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
• Angle-bounded 2D mesh simplification (Q2139713) (← links)
• Parallel computation of alpha complexes for biomolecules (Q2206738) (← links)
• Reducing complexity in polygonal meshes with view-based saliency (Q2396281) (← links)
• Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel (Q2424514) (← links)
• Load-Balancing for Parallel Delaunay Triangulations (Q3297568) (← links)
• Reducing Urban Concentration Using a Neural Network Model (Q3405723) (← links)
• Computational Geometry Methods and Intelligent Computing (Q3628356) (← links)
• Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations (Q3628371) (← links)
• Polyhedral GPU Accelerated Shape from Silhouette (Q3628512) (← links)
• An efficient simplification method for point cloud based on salient regions detection (Q5242353) (← links)
• A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems (Q6081030) (← links)
• A spectral segmentation method for large meshes (Q6169184) (← links)