Results 141 to 150 of about 979 (179)

Determining the Three-dimensional Convex Hull of a Polyhedron

IBM Journal of Research and Development, 1976
A method is presented for determining the three-dimensional convex hull of a real object that is approximated in computer storage by a polyhedron. Essentially, this technique tests all point pairs of the polyhedron for convex edges of the convex hull and then assembles the edges into the polygonal boundaries of each of the faces of the convex hull ...
Appel, A., Will, P. M.
openaire   +1 more source

The Skorokhod Oblique Reflection Problem in a Convex Polyhedron

gmj, 1996
Abstract The Skorokhod oblique reflection problem is studied in the case of n-dimensional convex polyhedral domains. The natural sufficient condition on the reflection directions is found, which together with the Lipschitz condition on the coefficients gives the existence and uniqueness of the solution.
openaire   +2 more sources

Minimization of the Hausdorff distance between convex polyhedrons

Journal of Mathematical Sciences, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lakhtin, A. S., Ushakov, V. N.
openaire   +1 more source

Outcrossings from Convex Polyhedrons for Nonstationary Gaussian Processes

Journal of Engineering Mechanics, 1993
This technical note concerns the estimation of the outcrossing rate of nonstationary Gaussian vector processes from a convex polyhedral limit-state surface enclosing the origin. The theoretically most attractive approach for this type of problem in time-dependent structural reliability analysis is to employ the concept of first-passage probability in ...
C. Q. Li, R. E. Melchers
openaire   +1 more source

Reflected Backward SDEs in a Convex Polyhedron

2020
A backward stochastic differential equation is forced to stay within a d-dimensional bounded convex polyhedral domain, thanks to the action of oblique reflecting process at the boundary. The Lipschitz continuity on the reflection directions together with the Lipschitz continuity of the drift gives the existence and uniqueness of the solution.
openaire   +1 more source

Algorithm of Decomposing Arbitrary Polyhedrons into Convex Pieces

2012
This paper presents a algorithm of decomposing arbitrary polyhedrons into convex pieces without adding new vertices, the number of the convex parts can close to the minimum. Firstly, construct the loop starting from the concave edge of the polyhedron. Select the loop which has the most number of concave edges and all vertices of the loop are coplanar ...
Ren Dawei, Liu Yanpeng
openaire   +1 more source

Problem of Second Grade Fluids in Convex Polyhedrons

SIAM Journal on Mathematical Analysis, 2012
This paper studies the solutions of a three-dimensional grade-two fluid model with a tangential boundary condition in a polyhedron. We begin to split the problem into a system with a generalized Stokes problem and a transport equation, as Girault and Scott have done in the two-dimensional case.
openaire   +1 more source

An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window

CVGIP: Graphical Models and Image Processing, 1991
Summary: An optimal algorithm is proposed to determine all the directions for translating (single translation) a convex polyhedron \(P\) through a two- dimensional window \(Q\). In this note we show that it is possible to determine all the directions for translating \(P\) through \(Q\) in optimal \(O(| P | + | Q |)\) time.
openaire   +2 more sources

Scaling deep learning for materials discovery

Nature, 2023
, Muratahan Aykol, Ekin Cubuk
exaly  

Convex polyhedron

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source