The question of extendability of the action of a cyclic group of automorphisms of a compact Riemann surface is considered. Particular attention is paid to those cases corresponding to Singerman's list of Fuchsian groups which are not nitely-maximal, and more generally to cases involving a Fuchsian triangle group. The results provide partial answers to the question of which cyclic groups are the...

The LEP investigation of the B 0 d and B 0 s oscillations and of the Cabibbo-Kobayashi-Maskawa matrix element |V ub | improve the constraints on the other elements of this matrix. From a fit to the experimental data and the theory calculations it is possible to determine the vertex of the unitarity triangle as:

We construct symmetric cubature formulae of degrees in the 1339 range for the surface measure on the unit sphere. We exploit a recently published correspondence between cubature formulae on the sphere and on the triangle. Specifically, a fully symmetric cubature formula for the surface measure on the unit sphere corresponds to a symmetric cubature formula for the triangle with weight function (...

The success of the classical formulation of the spectral element method lies in the choice of functional space, grid points, and method of integration. On the quadrilateral, the prefered space is a tensor product basis of Legendre polynomials, P 2 = fspan(x n y m)j0 m N; 0 n Ng: (1) The grid points are chosen as the Gauss-Lobatto-Legendre points, which lead to an accurate, well-behaved interpol...

We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, δ ≤ Z(G) where δ is the minimum degree, in the triangle-free case. In particular, we show that 2δ− 2 ≤ Z(G) for graphs with girth of at least 5, and this can be further improved when G has a small cut set. Lastly, we make a conjecture that the lower bound for Z(G) increases as a function of the g...

This thesis presents a complete system of algorithms to obtain a globally consistent surface representation, in the form of a triangle mesh, from a sequence of registered frames taken by a time-ofight (TOF) camera. Surface reconstruction from range images becomes increasingly important in wide elds of applications. The newly developed TOF imaging technology allows acquisition of 3D data in real...

This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Key-words: geometric predicates, low degree pr...

We construct a Teichmüller curve uniformized by the Fuchsian triangle group ∆(m, n, ∞) for every m < n ≤ ∞. Our construction includes the Teichmüller curves constructed by Veech and Ward as special cases. The construction essentially relies on properties of hypergeometric differential operators. For small m, we find bil-liard tables that generate these Teichmüller curves. We interprete some of ...

This paper presents a fast algorithm for generating triangle strips from triangulated meshes, providing a compact representation suitable for transmission and rendering of the models. A data structure that allows efficient triangle strip generation is also described. The method is based on simple heuristics, significantly reducing the number of vertices used to describe the triangulated models....

We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.