Results 171 to 180 of about 69,312 (204)
Computing the Minkowski sum of ruled surfaces
Graphical Models, 2003 Summary: The boundary of the Minkowski sum of two geometric objects is part of the so-called convolution surface of the boundary surfaces of the two input objects. In most cases, convolution surfaces can be computed only by numerical algorithms. The present paper studies convolution surfaces of ruled surfaces.
Mühlthaler, Heidrun, Pottmann, Helmut
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Exact minkowski sums and applications
Proceedings of the eighteenth annual symposium on Computational geometry, 2002(MATH) The Minkowski sum of two sets P and Q in $\realsd is the set (p+q \mid p E P, q E Q). Minkowski sums are useful in robot motion planning, computer-aided design and manufacturing (CAD/CAM) and many other areas. In this video we present a software package implemented at Tel Aviv University for the exact and efficient construction of Minkowski sums
Eyal Flato +3 more
openaire +1 more source
Slicing Minkowski sums for satellite antenna layout
Computer-Aided Design, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boissonnat, Jean-Daniel +2 more
openaire +1 more source
On Minkowski Sums of Many Small Sets
Functional Analysis and Its Applications, 2018A subset of a normed space is said to be infinitely divisible if it can be represented as the Minkowski sum of finitely many sets of arbitrarily small diameters. The main result of this paper is: Theorem 1. A weakly closed set in a Banach space is infinitely divisible if and only if it is convex and bounded.
Roginskaya, M. M., Shulman, V. S.
openaire +2 more sources
Dynamic Minkowski Sum Operations
2016The Minkowski sum is an important operation in a wide variety of applications ...
openaire +1 more source
Blob Metamorphosis based on Minkowski Sums
Computer Graphics Forum, 1996AbstractThis paper addresses the metamorphosis of soft objects built from skeletons. We propose a new approach that may be split into three steps. The first step consists in an original splitting of the initial and the final shapes with a view to creating a bijective graph of correspondence.
E. Galin, S. Akkouche
openaire +1 more source
An invertible Minkowski sum of figures
Systems and Computers in Japan, 1998Kokichi Sugihara +2 more
exaly +2 more sources
Exact minkowski sums of convex polyhedra
Proceedings of the twenty-first annual symposium on Computational geometry, 2005We present an exact imp ementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R3. Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and produces exact results.
Efi Fogel, Dan Halperin
openaire +1 more source
Minkowski's inequality and sums of squares
2012Positive polynomials arising from Muirhead's inequality, from classical power mean and elementary symmetric mean inequalities and from Minkowski's inequality can be rewritten as sums of squares.
Frenkel, P��ter E. +1 more
openaire +1 more source
Minkowski sum and mixed volume
1996A fundamental operation for convex sets is the following (which can be defined for arbitrary sets in ℝ n ).
openaire +1 more source