Results 131 to 140 of about 979 (179)

Contributing vertices-based Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron

2009 IEEE International Conference on Shape Modeling and Applications, 2009
We present an original approach for the computation of the Minkowski sum of a non-convex polyhedron without fold and a convex polyhedron, without decomposition and union steps—that constitute the bottleneck of convex decomposition-based algorithms. A non-convex polyhedron without fold is a polyhedron whose boundary is completely recoverable from three ...
Barki, Hichem, Denis, Florence, Dupont, Florent   +2 more
openaire   +1 more source

Novel Convex Polyhedron Classifier for Sentiment Analysis

2020 5th International Conference on Cloud Computing and Artificial Intelligence: Technologies and Applications (CloudTech), 2020
In this paper, we propose a Novel Convex Polyhedron classifier (NCPC) based on the geometric concept convex hull. NCPC is basically a linear piecewise classifier (LPC). It partitions linearly non-separable data into various linearly separable subsets. For each of these subset of data, a linear hyperplane is used to classify them.
Soufiane EL MRABTI, Mohamed LAZAAR, Mohammed AL ACHHAB, Hicham OMARA   +3 more
openaire   +1 more source

On antipodes on a convex polyhedron II

advg, 2010
Abstract We give several results concerning the notion of antipodes (i.e., farthest points) on the surface of a polyhedron endowed with its intrinsic metric.
openaire   +2 more sources

On antipodes on a convex polyhedron

advg, 2005
Abstract We define an antipode of a point p as a farthest point from p. In this paper we describe, on the surface of a convex polyhedron endowed with its intrinsic metric, points admitting at least two antipodes.
openaire   +2 more sources

Admissible points of a convex polyhedron

Journal of Optimization Theory and Applications, 1982
In this paper, we present several new properties of the admissible points of a convex polyhedron. These properties can be classified into two categories. One category concerns the characterization and generation of these points. The other category concerns the circumstances under which these points are efficient solutions for linear multiple-objective ...
openaire   +1 more source

The minimum sphere covering a convex polyhedron

Naval Research Logistics Quarterly, 1974
AbstractA finite algorithm is given for finding the smallest sphere enclosing a convex polyhedron in En described by a given system of linear equalities or inequalities. Extreme points of the polyhedron, and minimum spheres enclosing them, are generated in a systematic manner until the optimum is attained.
Elzinga, Jack, Hearn, Donald
openaire   +1 more source

Concave minimization over a convex polyhedron

Naval Research Logistics Quarterly, 1973
AbstractA general algorithm is developed for minimizing a well defined concave function over a convex polyhedron. The algorithm is basically a branch and bound technique which utilizes a special cutting plane procedure to' identify the global minimum extreme point of the convex polyhedron. The indicated cutting plane method is based on Glover's general
openaire   +1 more source

Reexamination of Convex Polyhedron Outcrossing Problem

Journal of Engineering Mechanics, 1994
Structural series‐system reliability analyses formulated solely by use of a finite number of random variables can often be done with sufficient accuracy in terms of first‐ or second‐order upper and lower bounds on the system failure probability. The bounds are of the first order if they are defined solely by the single‐element‐failure probabilities ...
openaire   +1 more source

Gaussian Outcrossings from Safe Convex Polyhedrons

Journal of Engineering Mechanics, 1983
A simple upper and lower bound technique developed for the evaluation of the failure probability of a “weakest link” structural system is applied to a structural system having a convex, polyhedral safe set in the space of basic variables. The structure is subjected to a Gaussian vector‐load‐effect process. Conditional second moment calculus, as applied
openaire   +1 more source

Expected Number of Vertices of a Random Convex Polyhedron

SIAM Journal on Algebraic Discrete Methods, 1981
Given m points on the unit sphere in n-space, the hyperplanes tangent to the sphere at the given points bound a convex polyhedron with m facets. If the points are chosen independently at random from the uniform distribution on the sphere, the number $V_{mn} $ of the vertices of the polyhedron is a random variable.
Kelly, D. G., Tolle, J. W.
openaire   +1 more source