https://cis.temple.edu/~lakaemper/courses/cis350_2004/etc/moeller_triangle.pdf
1 Introduction Most collision detection algorithms, such as OBBTree [Gottschalk96], sphere hier-archies [Hubbard96] and BV-trees [Klosowski97], try to minimize the number of primitive-primitive intersections that have to be computed. Still, a fast and reliable method for computing the primitive-primitive intersection is desired. Since render-ing hardware is often targeted for triangles, the ...
https://ronlevygroup.cst.temple.edu/courses/2017_spring/chem5412/lectures/Lecture4_SBII_2017.pdf
Using Protein-sequence-variation profitably Correlated Mutations and Structural Contacts
https://sites.temple.edu/newcombe/files/2013/06/Newcombe_et_al-2015-Wiley_Interdisciplinary_Reviews-_Cognitive_Science.pdf
There are many continuous quantitative dimensions in the physical world. Philo-sophical, psychological, and neural work has focused mostly on space and num-ber. However, there are other important continuous dimensions (e.g., time and mass). Moreover, space can be broken down into more specific dimensions (e.g., length, area, and density) and number can be conceptualized discretely or con ...
https://cis.temple.edu/~latecki/Papers/cvpr00.pdf
Abstract The Core Experiment CE-Shape-1 for shape descriptors performed for the MPEG-7 standard gave a unique oppor-tunity to compare various shape descriptors for non-rigid shapes with a single closed contour. There are two main dif-ferences with respect to other comparison results reported in the literature: (1) For each shape descriptor, the exper-iments were carried out by an institute ...
https://sites.temple.edu/cognitionlearning/files/2016/10/Park-et-al-2016_JEP.pdf
Although students’ motivational frameworks (entity vs. incremental) have been linked to academic achievement, little is known about how early this link emerges and how motivational frameworks develop in the first place. In a year-long study (student N 424, Teacher N 58), we found that, as early as 1st and 2nd grade, children who endorsed an incremental framework performed better on a ...
https://cis.temple.edu/~latecki/Papers/CSD_CVPR10.pdf
Abstract In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formal-ize the convex decomposition problem as an integer linear programming problem, and obtain approximate optimal so-lution by minimizing the total cost of decomposition under some concavity constraints. Our method is based on Morse theory and combines information from multiple Morse ...