We present an algorithm for compressing the radiosity view factor model commonly used in radiation heat transfer and computer graphics. use a format inspired by hierarchical off-diagonal low rank format, where elements are recursively partitioned using quadtree or octree blocks compressed sparse singular value decomposition—the matrix is assembled dynamic programming. The motivating application...

Finite quasi semimetrics on n can be thought of as nonnegative valuations the edges a complete directed graph vertices satisfying all possible triangle inequalities. They comprise polyhedral cone whose symmetry groups were studied for small by Deza, Dutour and Panteleeva. We show that combinatorial are they conjectured. Integral have special place in theory tiled orders, being known exponent ma...

Triangle listing plays an important role in graph analysis and has numerous graph mining applications. With the rapid growth of graph data, distributed methods for listing triangles over massive graphs are urgently needed. Therefore, the triangle listing problem has been studied in several distributed infrastructures including MapReduce. However, existing algorithms suffer from generating and s...

The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...

Harmonic inpainting with optimised data is very popular for inpainting-based image compression. We improve this approach in three important aspects. Firstly, we replace the standard finite differences discretisation by a element method triangle elements. This does not only speed up and selection, but even improves reconstruction quality. Secondly, propose highly efficient algorithms spatial ton...

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:

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 ...