These lines are the intersections of the plane through the point p in the world and the centres of the left and right cameras with the two camera focal planes (see Figure 1). These epipolar lines are formed by the intersections of the pencil of planes through the line joining the image centres with the camera focal planes. Hence such lines form a pencil passing through the point of intersection...

We generalize the strong Hanani-Tutte theorem to clustered graphs with two disjoint clusters, and show that an extension of our result to flat clustered graphs with three disjoint clusters is not possible. We also give a new and short proof for a result by Di Battista and Frati about efficient c-planarity testing of an embedded flat clustered graph with small faces based on the matroid intersec...

ÐThe minimum length test sequence generation method proposed in [2] for conformance testing of a protocol uses Unique Input Sequences (UIS) for state identification. This method, called the U-method, requires that the test graph, a graph derived from the protocol, be connected. This requirement also needs to be satisfied in the case of the MU-method [31], [30], which assumes that the multiple U...

Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network 3ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for #nding a maximum cardinality vector in a matching 2-lattice polyhedron. c © 2001 Elsevier Science B.V. All rights reserved.

In this note, we study a constrained independent set problem for matroids and certain generalizations. The basic problem can be regarded as an ordered version of the matroid parity problem. By a reduction of this problem to matroid intersection, we prove a min-max formula. Studying the weighted case and a delta-matroid generalization, we prove that some of them are not more complex than matroid...