Related papers: T-Base: A Triangle-Based Iterative Algorithm for S…
This paper develops an algorithm that identifies and decomposes a median graph of a triangulation of a 2-dimensional (2D) oriented bordered surface and in addition restores all corresponding triangulation whenever they exist. The algorithm…
A smooth T-surface can be thought of as a generalization of a surface of revolution in such a way that the axis of rotation is not fixed at one point but rather traces a smooth path on the base plane. Furthermore, the action, by which the…
Gradient methods are among the simplest yet most widely used algorithms for unconstrained optimization. Motivated by a geometric property of the steepest descent (SD) method that can alleviate the zigzag behavior in quadratic problems, we…
We present a novel shape-approximating anisotropic re-meshing algorithm as a geometric generalization of the adaptive moving mesh method. Conventional moving mesh methods reduce the interpolation error of a mesh that discretizes a given…
Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…
Recently, a novel method for developing filtering algorithms, based on the parallel concatenation of Bayesian filters and called turbo filtering, has been proposed. In this manuscript we show how the same conceptual approach can be…
Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary…
This paper presents a new algorithm, Weighted Squared Volume Minimization (WSVM), for generating high-quality tetrahedral meshes from closed triangle meshes. Drawing inspiration from the principle of minimal surfaces that minimize squared…
Surfaces are typically represented as meshes, which can be extracted from volumetric fields via meshing or optimized directly as surface parameterizations. Volumetric representations occupy 3D space and have a large effective receptive…
Differentiable rendering with 3D Gaussian primitives has emerged as a powerful method for reconstructing high-fidelity 3D scenes from multi-view images. While it offers improvements over NeRF-based methods, this representation still…
3D shape analysis is an important research topic in computer vision and graphics. While existing methods have generalized image-based deep learning to meshes using graph-based convolutions, the lack of an effective pooling operation…
In this paper, a wideband and low-scattering metasurface in terahertz (THz) is introduced. The proposed coding metasurface is composed of four different graphene square patches in one layer, which has a distinct bias voltage. By optimizing…
When a material surface is functionalized so as to acquire some type of order, functionalization of which soft condensed matter systems have recently provided many interesting examples, the modeller faces an alternative. Either the order is…
Network alignment has extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation…
This paper presents a Bayesian framework for manipulating mesh surfaces with the aim of improving the positional integrity of the geological boundaries that they seek to represent. The assumption is that these surfaces, created initially…
Conformal and quasi-conformal mappings have widespread applications in imaging science, computer vision and computer graphics, such as surface registration, segmentation, remeshing, and texture map compression. While various conformal and…
We propose an algorithm for tracing polylines on a triangle mesh such that: they are aligned with a N-symmetry direction field, and two such polylines cannot cross or merge. This property is fundamental for mesh segmentation and is very…
We propose a numerical method for solving block-structured mesh partitioning problems based on the variational level-set method of (Zhao et al., J Comput Phys 127, 1996) which has been widely used in many partitioning problems such as image…
We propose two new Bayesian smoothing methods for general state-space models with unknown parameters. The first approach is based on the particle learning and smoothing algorithm, but with an adjustment in the backward resampling weights.…