ANN

swMATH9854MaRDI QIDQ21833FDOQ21833

Author name not available (Why is that?)

Cited In (34)

• A numerical algorithm for multidimensional modeling of scattered data points
• The Monge-Ampère-Kantorovich approach to reconstruction in cosmology
• Practical methods for shape fitting and kinetic data structures using coresets
• Title not available (Why is that?)
• Rapid and effective segmentation of 3D models using random walks
• Surface reconstruction by parallel and unified particle-based resampling from point clouds
• Improved Implementation of Point Location in General Two-Dimensional Subdivisions
• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• Title not available (Why is that?)
• Parallel and adaptive surface reconstruction based on implicit PHT-splines
• Title not available (Why is that?)
• Texture synthesis via the matching compatibility between patches
• A local least-squares method for solving nonlinear partial differential equations of second order
• SimBa: An Efficient Tool for Approximating Rips-filtration Persistence via Simplicial Batch-collapse
• Efficient Neighbor Search for Particle Methods on GPUs
• Efficient and robust persistent homology for measures
• A logarithmic-time solution to the point location problem for parametric linear programming
• Toward approximate moving least squares approximation with irregularly spaced centers
• Title not available (Why is that?)
• A contact dynamics approach to the granular element method
• Efficient Random-Walk Methods for Approximating Polytope Volume
• Neighborhood density information in clustering
• SimBa
• An object-oriented environment for developing finite element codes for multi-disciplinary applications
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Nonlinear manifold learning for meshfree finite deformation thin-shell analysis
• GAPS: A clustering method using a new point symmetry-based distance measure
• A weighted \(k\)-nearest neighbor density estimate for geometric inference
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• Implementation techniques for geometric branch-and-bound matching methods
• Arbitrage-free approximation of call price surfaces and input data risk
• A symmetry based multiobjective clustering technique for automatic evolution of clusters
• Improved radial basis function fluid-structure coupling via efficient localized implementation
• An information theoretic approach to use high-fidelity codes to calibrate low-fidelity codes

This page was built for software: ANN