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

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

In this paper, the physical optics method is used to study the problem of electromagnetic scattering from Haack series nose cone. First, a meshing scheme is introduced which approximates the curvature of the surface by piecewise linear functions in both axial and rotational directions. This results in planar quadrilateral patches and enables efficient determination of the illuminated region and...

Journal: :J. Comb. Theory, Ser. B 1990
Éva Tardos

We generalize the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is par...

2012
Juan Li Chunfu Shao Chunjiao Dong Dan Zhao Yinhong Liu

Mixed-traffic (e.g., pedestrians, bicycles, and vehicles) data at an intersection is one of the essential factors for intersection design and traffic control. However, some data such as pedestrian volume cannot be directly collected by common detectors (e.g. inductive loop, sonar and microwave sensors). In this paper, a video based detection algorithm is proposed for mixed-traffic data collecti...

سید رسول نوریان, , غلامعباس پارسافر, ,

  Some new equations of state which are derived for dense fluids in recent years, namely the linear isotherm regularity (LIR), the dense system equation of state (DSEOS), Inm-Song-Mason equation of state (ISM), and a newly derived semi-emperical equation of state have been used to investigate the common intersection point of isobaric expansivity in αp dense fluids. We have shown that the accura...

2006
Jérémy Barbay Alejandro López-Ortiz Tyler Lu

The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, which improves over those proposed by Demaine, Munro and López-Ortiz [SODA 2000/ALENEX 2001], by using a variant of interpolation search. More specifically, our contributions are threefold. First, we corrob...

Journal: :Spatial Cognition & Computation 2014
Lin Wang Weimin Mou Xianghong Sun

Two experiments investigated how people develop different landmark knowledge at decision points. Participants learned a route in a virtual city once or five times. One distinctive landmark was placed at each intersection of the route. At test, participants were released at each intersection according to the learning order and were required to determine the turning direction. At each intersectio...

2001
Jack Snoeyink

By looking for algorithms that require minimum arithmetic precision, we obtain a simple ray-polygon intersection test that more easily handles degenerate cases.

Journal: :نشریه دانشکده فنی 0
علی بابائی زاده هاشم مهرآذین

when the degree of saturation at intersection approaches one, webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. this is not a problem for hcm2000 method. but optimum cycle length calculation in this method h...

Journal: :journal of advances in computer research 0

information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. the document processor, matching function and query analyzer are the main components of an information retrieval system. document retrieval system is fundamentally based on: boolean, vector-space, probabilistic, and language models. in this paper, a new methodology for mat...

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

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