نتایج جستجو برای: change of intersection point
تعداد نتایج: 21234248 فیلتر نتایج به سال:
abstract the primary purpose of this study was to explore the actual practices and cognitions of two groups of iranian eap teachers, i.e. language teachers and content teachers, with respect to teaching reading-comprehension and vocabulary. to this end, tehran university of medical sciences which authorizes both groups of teachers to teach eap courses was selected as the context of the study s...
Providing faultless proceeding of the engineer in order to protect the rivers, requires understanding the morphological behavior of the river and studying the hydrodynamic phenomena of the area. The intersection of the Karun rivers as the largest and longest river in Iran with the Arvand border river is of considerable importance due to its strategic location. In this paper, using field measure...
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n log n). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n log n). Two additio...
The main motivation of this work is the problem of compute intersection curve between two surface. The surface/surface intersection, is a fundamental problem in computational geometry and geometric modelling of complex shapes. In general surface intersections, the most commonly used methods include subdivision and marching. Marching-based algorithms begin by finding a starting point on the inte...
A simple en,ex rule to mark the intersection points of 2D input polygon contours separating the polygon interior from its exterior in the vicinity of the intersections is presented. Its form is close to the original Greiner & Hormann algorithm rule but encompasses degenerate intersections that are not self-intersections. It only uses local geometric information once the orientation of the two i...
Interval Mapping offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique utilizes an interval based method in which bounds of the interval are computed in the beginning and are refined at every iteration until the intersection point is reached. The search space defined by the interval reduces and converges to the...
Abstract. Given a lattice polytope, the secondary fan is a combinatorial structure on the space of all tropical polynomials supported on the polytope. We consider rationally weighted formal sums of cones in the secondary fan as an approximation to a tropical variety. By using tropical intersection theory, we are able to intersect these formal sums with point-condition-imposing hyperplanes. Form...
An algorithm is demonstrated that finds an ordinary intersection in an arrangement of n lines in R, not all parallel and not all passing through a common point, in time O(n logn). The algorithm is then extended to find an ordinary intersection among an arrangement of hyperplanes in R, no d passing through a line and not all passing through the same point, again, in time O(n logn). Two additiona...
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique utilizes an interval based method in which bounds of the interval are computed in the beginning and are refined at every iteration until the intersection point is reached. The search space defined by the interval reduce...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید