A band is the intersection of the surface of a convex polyhedron with the space between two parallel planes, as long as this space does not contain any vertices of the polyhedron. The intersection of the planes and the polyhedron produces two convex polygons. If one of these polygons contains the other in the projection orthogonal to the parallel planes, then the band is nested. We prove that a...

• Spatial segmentation of each ROB images using an edge detector, contour following and closing algorithms; • Characterization: each intersection of the segments is now characterized by: color: statistical parameters of the RO B values of pixels within the intersection; shape: perimeter, area , compactness; orientation; topology: neighbor, inclusion. • Merging of the elementary segments based o...

Vertices of an affiliation network are linked to features and two vertices are declared adjacent whenever they share a common feature. We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks. We establish the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients showing how these edge...

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph T (G) has the triangles of the graph G as its vertices, two of these being adjacent whenever as triangles in G they share an edge. A graph is edge-triangular if every edge is in at least one triangle. ...

3 Intersection with an Oriented Box 4 3.1 Culling Against Planes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Cone-Vertex-in-Box Test and Polygon Lookup . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 Box-Corner-in-Cone Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.4 Box-Edge-Intersects-Cone Test . . ....

This paper addresses the problem of obtaining a consistent estimate (or upper bound) of the covariance matrix when combining two quantities with unknown correlation. The combination is defined linearly with two gains. When the gains are chosen a priori, a family of consistent estimates is presented in the paper. The member in this family having minimal trace is said to be “family-optimal”. When...

To reduce the degradation of multi-vehicle cooperative control performance for connected and automated vehicles caused by time-varying communication delays when edge-cloud is used centralized through vehicle to infrastructure communication, further improve traffic efficiency based on driving safety at unsignalized multi-intersection. A networked predictive method an improved model-free adaptive...

A string graph is the intersection graph of a family of continuous arcs in the plane. The intersection graph of a family of plane convex sets is a string graph, but not all string graphs can be obtained in this way. We prove the following structure theorem conjectured by Janson and Uzzell: The vertex set of almost all string graphs on n vertices can be partitioned into five cliques such that so...

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the nonnegative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Came...