Related papers: Exact computation of the color function for triang…
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…
Qubit-efficient optimization studies how large combinatorial problems can be addressed with quantum circuits whose width is far smaller than the number of logical variables. In quadratic unconstrained binary optimization (QUBO), objective…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
In numerical simulations of two-phase flows, the computation of the curvature of the interface is a crucial ingredient. Using a finite element and level set discretization, the discrete interface is typically the level set of a low order…
This work presents an overview of mesh-induced errors commonly experienced by cell-centred finite volumes (CCFV), for which the face-centred finite volume (FCFV) paradigm offers competitive solutions. In particular, a robust FCFV solver for…
The quantitative characterization of the microstructure of random heterogeneous media in $d$-dimensional Euclidean space $\mathbb{R}^d$ via a variety of $n$-point correlation functions is of great importance, since the respective infinite…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
Accurate numerical modeling of surface tension has been a challenging aspect of multiphase flow simulations. The integral formulation for modeling surface tension forces is known to be consistent and conservative, and to be a natural choice…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the…
We define an $n$-gon to be any convex polygon with $n$ vertices. Let $V$ represent the set of vertices of the polygon. A proper $k$-coloring refers to a function, $f$ : $V$ $\rightarrow$ $\{1, 2, 3, ... k\}$, such that for any two vertices…
The aim of this paper is to propose new algorithms for Field of Vision (FOV) computation which improve on existing work at high resolutions. FOV refers to the set of locations that are visible from a specific position in a scene of a…
We introduce a fast and robust algorithm for finding a plane $\Gamma$ with given normal $\vec{n}_\Gamma$, which truncates an arbitrary polyhedron $\mathcal{P}$ such that the remaining sub-polyhedron admits a given volume…
Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…
Purpose: This study aims to assess the robustness and accuracy of the face-centred finite volume (FCFV) method for the simulation of compressible laminar flows in different regimes, using numerical benchmarks. Design/methodology/approach:…
Rubik's Cube is one of the most famous combinatorial puzzles involving nearly $4.3 \times 10^{19}$ possible configurations. Its mathematical description is expressed by the Rubik's group, whose elements define how its layers rotate. We…
This work develops, for the first time, a face-centred finite volume (FCFV) solver for the simulation of laminar and turbulent viscous incompressible flows. The formulation relies on the Reynolds-averaged Navier-Stokes (RANS) equations…
Brain volume calculations are crucial in modern medical research, especially in the study of neurodevelopmental disorders. In this paper, we present an algorithm for calculating two classifications of brain volume, total brain volume (TBV)…
The research interest of this paper is focused on the efficient clustering task for an arbitrary color data. In order to tackle this problem, we have tried to model the inherent uncertainty and vagueness of color data using fuzzy color…
We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…