Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are more complex and time consuming. In this case the object is usually closed into a simple bounding volume to speed up the cases when the given line cannot in...

Performing fast and accurate collision detection between geometric models is still most open problems in modeling, robotics, manufacturing and computer-simulated environments. Most of previous method seems to have their own specification and restricted to a specific geometric models. For example, convex polytopes tend to solve accuracy problems but left behind the speed of collision detection. ...

We discuss a comparison of the entropy of pseudo-Anosov maps and the volume of their mapping tori. Recent study of Weil-Petersson geometry of the Teichmüller space tells us that they admit linear inequalities for both directions under some bounded geometry condition. Based on the experiments, we present various observations on the relation between minimal entropies and volumes, and on bounding ...

We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-tightness, the resemblance to ellipsoid, a novel functional is formulated that governs an optimization process to obtain a partition with multiple components. Refinement of segmentation is driven by application-specific e...

We study the learnability of enumerable families L of uniformly recursive languages in dependence on the number of allowed mind changes, i.e., with respect to a well{studied measure of e ciency. We distinguish between exact learnability (L has to be inferred w.r.t. L) and class preserving learning (L has to be inferred w.r.t. some suitable chosen enumeration of all the languages from L) as well...

In this paper we show that developing a global illumination (GI) renderer can be made efficient through the creation of a multi-mode rendering system. Such a system should include a real-time target coupled with scene modification tools and using hierarchical scenes and bounding volumes to optimize the development cycle and run-time performance. Additional design considerations include using th...

Hair-to-hair interaction is often ignored in human hair modeling, due to its computational and algorithmic complexity. In this paper, we present our experimental approach to simulate the complex behavior of long human hair, taking into account hairto-hair interactions. We describe a thin shell volume (TSV) model for enhancing hair realism by simulating complex hair-hair interaction. The TSV is ...

This paper presents a new corpus, the Personality Dyads Corpus, consisting of multimodal data for three conversations between three personality-matched, two-person dyads (a total of 9 separate dialogues). Participants were selected from a larger sample to be 0.8 of a standard deviation above or below the mean on the Big-Five Personality extraversion scale, to produce an Extravert-Extravert dyad...