Results 41 to 50 of about 69,312 (204)
Exact Minkowski sums of polygons with holes [PDF]
13 pages, 7 figures.
Baram, Alon +4 more
openaire +3 more sources
Erratum to ”On Convolution surfaces in Euclidean spaces”
In the present study we give some corrections for our paper which published in the first volume of this journal.
Kadri Arslan, Selin Aydöner
doaj +1 more source
A lower bound for the size of a Minkowski sum of dilates [PDF]
Let A be a finite non-empty set of integers. An asymptotic estimate of the size of the sum of several dilates was obtained by Bukh. The unique known exact bound concerns the sum |A + k·A|, where k is a prime and |A| is large. In its full generality, this
Hamidoune, Yayha Old +1 more
core +2 more sources
This work considers the Minkowski sum of an N-dimensional ellipsoid and hyperrectangle, a combination that is extremely relevant due to the usage of ellipsoid-adjacent primitives in computer graphics for work such as 3D Gaussian splatting.
Martijn Courteaux +3 more
doaj +1 more source
Simple offset algorithm for generating workpiece solid model for milling simulation
In the milling simulation of a large stamping die for an automobile part, a workpiece solid model is necessary as an input data. The initial shape of the workpiece is generally equivalent to an offset shape of the stamping die CAD model.
Masatomo INUI +2 more
doaj +1 more source
The key to successful maneuvering complex extended object tracking (MCEOT) using range extent measurements provided by high resolution sensors lies in accurate and effective modeling of both the extension dynamics and the centroid kinematics.
Lifan Sun +4 more
doaj +1 more source
Interfacial transition zone (ITZ) is an important component of a concrete-like material. Accurately simulating the ITZ's characteristics of the concrete-like materials is a difficult process in numerical simulation.
Shibing Zhang +6 more
doaj +1 more source
Generalized Permutohedra from Probabilistic Graphical Models [PDF]
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be constructed as
Caroline Uhler +13 more
core +2 more sources
GPU-Based Super-union for Minkowski Sum [PDF]
We present an efficient and robust algorithm to approximate the 3D Minkowski sum of two arbitrary polyhedra on Graphics Processing Unit (GPU). Our algorithm makes use of the idea of super- union, in which we decompose the two polyhedra into convex pieces as usual, but the way we perform pairwise convex Minkowski sum and merge the pairwise sums one by ...
Leung, Yuen Shan +2 more
openaire +3 more sources
A note on α−irresolute topological rings
In [4], we introduced the notion of α−irresolute topological rings in Mathematics. This notion is independent of topological rings. In this note, we point out that under certain conditions an α−irresolute topological ring is topological ring and vice ...
Madhu Ram
doaj +1 more source

