A Linear Algorithm for Collision Detection of 3-Dimensional Convex Polytopes

Given two disjoint 3-dimensional convex polytopes P and Q and a straight direction along Which P moves in translation, this paper presents a linear algorithm for determining Whether P collides with Q, and the possible collision positions on P and Q. This result is achieved by using the hierarchicat representation of polytopes, of which the preprocessing time is linear with space.

Ehrhart Polynomials of 3-Dimensional Simple Integral Convex Polytopes

The author gives an explicit formula on the Ehrhart polynomial of a 3-dimensional simple integral convex polytope by using toric geometry.

Applications of new affine invariant for polytopes

To study the Schneider＇s projection problem, Lutwak, Yang and Zhang recently introduced a new .affine invariant functional U（P） for convex polytopes in R^n. In the paper, we obtain the analytic expression of the affine-invariant U（P） defined on a specific subclass of origin-symmetric convex polytopes in Rn and give an application of U（P） to the Lp-Minkowski problem.

Multi-objective robust controller synthesis for discrete-time systems with convex polytopic uncertain domain

Multi-objective robust state-feedback controller synthesis problems for linear discrete-time uncertain systems are addressed. Based on parameter-dependent Lyapunov functions, the Gl2 and GH2 norm expressed in terms of LMI (Linear Matrix Inequality) characterizations are further generalized to cope with the robust analysis for convex polytopic uncertain system. Robust state-feedback controller synthesis conditions are also derived for this class of uncertain systems. Using the above results, multi-objective state-feedback controller synthesis procedures which involve the LMI optimization technique are developed and less conservative than the existing one. An illustrative example verified the validity of the approach.

THE DISCRETE ORLICZ-MINKOWSKI PROBLEM FOR p-CAPACITY

In this paper,we demonstrate the existence part of the discrete Orlicz-Minkowski problem for p-capacity when 1<p<2.

On the Buchstaber Invariant of Simple Convex 3-Polytopes

and uses it imply that application In this paper the author gives a method of constructing characteristic matrices, to determine the Buchstaber invariants of all simple convex 3-polytopes, which each simple convex 3-polytope admits a characteristic function. As a further of the method, the author also gives a simple new proof of five-color theorem.

New Results on Stability and Stabilization of Delayed Caputo Fractional Order Systems with Convex Polytopic Uncertainties

In this paper,the problems of robust stability and stabilization,for the first time,are studied for delayed fractional-order linear systems with convex polytopic uncertainties.The authors derive some sufficient conditions for the problems based on linear matrix inequality technique combined with fractional Razumikhin stability theorem.All the results are obtained in terms of linear matrix inequalities that are numerically tractable.The proposed results are quite general and improve those given in the literature since many factors,such as discrete and distributed delays,convex polytopic uncertainties,global stability and stabilizability,are considered.Numerical examples and simulation results are given to illustrate the effectiveness of the effectiveness of our results.

Real-valued valuations on Sobolev spaces

Continuous, SL(n) and translation invariant real-valued valuations on Sobolev spaces are classified.The centro-affine Hadwiger's theorem is applied. In the homogeneous case, these valuations turn out to be L^p-norms raised to p-th power(up to suitable multipication scales).

The Partial Quotients of Moment-angle Manifolds over a Polygon

In this paper, we generalize the conception of characteristic function in toric topology and construct many new smooth manifolds by using it. As an application, we classify the Moment-Angle manifolds and the partial quotients manifolds of them over a polygon. In the appendix we give a simple new proof for Orlik-Raymond＇s theorem in terms of characteristic function which gives the classification for quasitoric manifolds of dimension 4.

On Descriptions of Products of Simplices

The authors give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that are inspired by the ideas from toric topology. In addition, they give a shorter proof of a well known criterion on this subject.