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

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

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

DStrips is a simple and efficient method to dynamically manage and generate triangle strips for real-time viewdependent multiresolution meshing and rendering. Progressive view-dependent triangle mesh simplification and rendering is an important concept for interactive visualization environments. To minimize the rendering cost, triangle meshes are simplified to the maximal tolerated perceptual e...