نتایج جستجو برای: intersection test

تعداد نتایج: 839528  

2009
Andreas Raabe Jan Tietjen Joachim K. Anlauf

Software implementations that test two triangles for intersection often favour speed over exact calculation. They leave it to the user to choose an exact or a fast test depending on the domain of application. Hardware implementations can not opt to make this distinction since users will always expect an accelerator hardware to be applicable in all possible settings. This paper introduces a nove...

2000
Jay Hoeflinger Yunheung Paek

The internal mechanism used for a dependence test constrains its accuracy and determines its speed. The internal mechanism used for our Access Region Test (ART) is fundamentally different from that used in any other dependence test, and therefore its constraints and characteristics are likewise different. In this paper, we briefly describe our novel descriptor for representing memory accesses, ...

Journal: :Journal of the experimental analysis of behavior 2011
Harry A Mackay Krista M Wilkinson Colleen Farrell Richard W Serna

Sidman (1994) noted that the existence of a member that is common to more than one class may produce either class merger (union) or class intersection. A multiple-selection, matching-to-sample test was developed to examine the conditions under which these outcomes occur. Test trials each required three conditional discriminations involving selection or rejection of comparison stimuli under cont...

Arash Abbasi Mansour Haji Hosseinlou

Roundabout is one of the most effective intersection control methods in the world. Although, they have often been used in Iran, but, the methods which are proposed to analyze roundabouts are very old and new regulations are not implemented for analyzing modern roundabouts. There are strong needs to apply new modern analyzing methods for studying roundabouts in Iran. Also, these methods should b...

Journal: :J. Algorithms 1984
Harold N. Gabow Robert E. Tarjan

Journal: :IEEE Trans. Vis. Comput. Graph. 2001
James E. Gain Neil A. Dodgson

ÐFree-Form Deformation (FFD) is a versatile and efficient modeling technique which transforms an object by warping the surrounding space. The conventional user-interface is a lattice of movable control points but this tends to be cumbersome and counterintuitive. Directly Manipulated Free-Form Deformation (DMFFD) allows the user to drag object points directly and has proven useful in an interact...

2013
John Frederick Sweeney

This paper examines a point of intersection between the work of the late Robert de Marrais and Vedic Physics. Specifically, de Marrais discussed the concept of Lissajous Figures in relation to Sedenions and his 42 Assessors, in his first paper about Box Kites. Later, John Baez took up a related subject, the problem of epicycloids, apparently without having read the work of de Marrais. This pape...

Journal: :CoRR 2010
Seokhyoung Lee Vladimir Shin

In this paper, low-complexity distributed fusion filtering algorithm for mixed continuous-discrete multisensory dynamic systems is proposed. To implement the algorithm a new recursive equations for local cross-covariances are derived. To achieve an effective fusion filtering the covariance intersection (CI) algorithm is used. The CI algorithm is useful due to its low-computational complexity fo...

2015
David Eberly

3 Intersection with an Oriented Box 4 3.1 Culling Against Planes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Cone-Vertex-in-Box Test and Polygon Lookup . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 Box-Corner-in-Cone Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.4 Box-Edge-Intersects-Cone Test . . ....

Journal: :Electr. J. Comb. 2006
Boris Bukh

We give a simpler proof of the result of Boros and Füredi that for any finite set of points in the plane in general position there is a point lying in 2/9 of all the triangles determined by these points. Introduction Every set P of n points in R in general position determines ( n d+1 ) d-simplices. Let p be another point in R. Let C(P, p) be the number of the simplices containing p. Boros and F...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید