Related papers: Robust Node Generation for Meshfree Discretization…
Derivative boundary conditions introduce challenges for mesh-free discretizations of PDEs on surfaces, especially when the domain is represented by randomly sampled point clouds. The recently developed two-step tangent-space RBF-generated…
This paper proposes an original adaptive refinement framework using Radial Basis Functions-generated Finite Differences method. Node distributions are generated with a Poisson Disk Sampling-based algorithm from a given continuous density…
Constrained radial basis function (RBF) regression has recently emerged as a powerful meshless tool for reconstructing continuous velocity fields from scattered flow measurements, particularly in image-based velocimetry. However, existing…
In this paper, given a random uniform distribution of sensor nodes on a 2-D plane, a fast self-organized distributed algorithm is proposed to find the maximum number of partitions of the nodes such that each partition is connected and…
Geophysical model domains typically contain irregular, complex fractal-like boundaries and physical processes that act over a wide range of scales. Constructing geographically constrained boundary-conforming spatial discretizations of these…
This paper introduces a novel, robust, and computationally efficient framework for high-quality quadrilateral mesh generation on general two-dimensional domains. The core of the proposed approach is a novel method for computing cross fields…
We propose a two dimensional (2D) adaptive nodes technique for irregular regions. The method is based on equi-distribution principal and dimension reduction. The mesh generation is carried out by first producing some adaptive nodes in a…
Depth refinement aims to infer high-resolution depth with fine-grained edges and details, refining low-resolution results of depth estimation models. The prevailing methods adopt tile-based manners by merging numerous patches, which lacks…
Local meshless methods using RBFs augmented with monomials have become increasingly popular, due to the fact that they can be used to solve PDEs on scattered node sets in a dimension-independent way, with the ability to easily control the…
For the Poisson equation posed in a domain containing a large number of polygonal perforations, we propose a low-dimensional coarse approximation space based on a coarse polygonal partitioning of the domain. Similarly to other multiscale…
Domain discretization is an essential part of the solution procedure in numerical simulations. Meshless methods simplify the domain discretization to positioning of nodes in the interior and on the boundary of the domain. However, generally…
This paper presents a methodology aiming at easing considerably the generation of high-quality meshes for complex 3D domains. We show that the whole mesh generation process can be controlled with only five parameters to generate in one…
We introduce PolyDiff, the first diffusion-based approach capable of directly generating realistic and diverse 3D polygonal meshes. In contrast to methods that use alternate 3D shape representations (e.g. implicit representations), our…
The shifted boundary method (SBM) is an approximate domain method for boundary value problems, in the broader class of unfitted/embedded/immersed methods. It has proven to be quite efficient in handling problems with complex geometries,…
Probabilistic diffusion models have achieved state-of-the-art results for image synthesis, inpainting, and text-to-image tasks. However, they are still in the early stages of generating complex 3D shapes. This work proposes Diffusion-SDF, a…
Controllable, high-fidelity mesh editing remains a significant challenge in 3D content creation. Existing generative methods often struggle with complex geometries and fail to produce detailed results. We propose CraftMesh, a novel…
The stochastic formation of defects during Laser Powder Bed Fusion (L-PBF) negatively impacts its adoption for high-precision use cases. Optical monitoring techniques can be used to identify defects based on layer-wise imaging, but these…
Randomized smoothing is a general technique for computing sample-dependent robustness guarantees against adversarial attacks for deep classifiers. Prior works on randomized smoothing against L_1 adversarial attacks use additive smoothing…
We introduce a framework for joint grounded scene graph - image generation, a challenging task involving high-dimensional, multi-modal structured data. To effectively model this complex joint distribution, we adopt a factorized approach:…
The approaches taken to describe and develop spatial discretisations of the domains required for geophysical simulation models are commonly ad hoc, model or application specific and under-documented. This is particularly acute for…