pointing towards the sensor and a i is a binary number depending on the intersection of l and Q i , and The reason behind taking a weighted sum of the intersection points is that the sensor measurement of the position of a surface point is less reliable if the local surface is facing away from the sensor. The weight w i is a reflection of this heuristic. In general, the sensor direction informa...

Identification of a real time of a change in a process, when an out-of-control signal is present is significant. This may reduce costs of defective products as well as the time of exploring and fixing the cause of defects. Another popular topic in the Statistical Process Control (SPC) is profile monitoring, where knowing the distribution of one or more quality characteristics may not be appropr...

We propose a method of improving the reconstruction of edges and corners in surface meshes of sparsely populated point clouds by exploiting the presence of planes in the scene, the calculated geometry of the cameras and the images themselves. By robustly identifying co-planar points in the point cloud, isolating suitable plane-pairs for intersection, identifying the regions-of-interest along th...

We prove the Faber intersection number conjecture and other more general results by using a recursion formula of n-point functions for intersection numbers on moduli spaces of curves. We also present several conjectural properties of Gromov-Witten invariants generalizing results on intersection numbers.

The Voronoi-based 9-intersection model (V9I) is a modified version of the original point-set-based 9-intersection model. The modification is made by replacing the complement (exterior) of an entity with its Voronoi region. It is shown in this paper that it is possible to solve the three major problems associated with the original 9-intersection model with the new V9I model.

Currently, most intersection models embedded in macroscopic Dynamic Network Loading (DNL) models are not well suited for urban and regional applications. This is so because socalled internal intersection supply constraints, bounding flows due to crossing and merging conflicts inherent to the intersection itself, are missing. This paper discusses the problems that arise upon introducing such con...

A proper non-empty subset C of the points of a linear space S = (P; L) is called line-closed if any two intersecting lines of S , each meeting C at least twice, have their intersection in C. We show that when every line has k points and every point lies on r lines the maximum size for such sets is r + k ? 2. In addition it is shown that this cannot happen for projective spaces PG(n; q) unless q...