نتایج جستجو برای: clipping

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

2015
Mahmud Abdulkader Mahmud Mark Spigt Afework Mulugeta Bezabih Ignacio Lopez Pavon Geert-Jan Dinant Roman Blanco Velasco Zulfiqar A. Bhutta

BACKGROUND Intestinal parasitic infections are highly endemic among school-aged children in resource-limited settings. To lower their impact, preventive measures should be implemented that are sustainable with available resources. The aim of this study was to assess the impact of handwashing with soap and nail clipping on the prevention of intestinal parasite reinfections. METHODS AND FINDING...

Journal: :Stroke 2006
Gary J Redekop

See related article, pages ●●●–●●● Early aneurysm repair to prevent recurrent bleeding is central to the management of patients with subarachnoid hemorrhage. Over the past 15 years, endovascular occlusion of cerebral aneurysms has emerged as an alternative to microsurgical clipping, and the relative merits and shortcomings of these 2 approaches have been the subject of considerable discussion i...

2000
S. H. Martin Roth Patrick Diezi Markus H. Gross

This short paper introduces a new approach to finding ray– patch intersections with triangular Bernstein–Bézier patches of arbitrary degree. Unlike a previous approach based on a combination of hierarchical subdivision and a Newton–like iteration scheme [7], this work extends the concept of Bézier clipping to the triangular domain. The problem of reporting wrong intersections, inherent to the o...

Journal: :JACC: Cardiovascular Interventions 2016

Journal: :Computers & Graphics 1994
Václav Skala

A new O N (lg ) line clipping algorithm in E against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.

2005
David Eberly

A classic problem in computer graphics is to decompose a simple polygon into a collection of triangles whose vertices are only those of the simple polygon. By definition, a simple polygon is an ordered sequence of n points, ~ V0 through ~ Vn−1. Consecutive vertices are connected by an edge 〈~ Vi, ~ Vi+1〉, 0 ≤ i ≤ n − 2, and an edge 〈~ Vn−1, ~ V0〉 connects the first and last points. Each vertex ...

2002
V. MURALI G. LUBCZONOK

This paper considers fuzzy subbundles of a vector bundle. We define the operations sum, product, tensor product, Hom, and intersection of fuzzy subbundles and in each case, we characterize the corresponding flag of vector subbundles. We then propose two alternative definitions of integrability on fuzzy subbundles of a given type and discuss their naturality, merits, and shortcomings. We do thes...

Journal: :CoRR 2018
Yasuhiro Fujita Shin-ichi Maeda

Many continuous control tasks have bounded action spaces and clip out-of-bound actions before execution. Policy gradient methods often optimize policies as if actions were not clipped. We propose clipped action policy gradient (CAPG) as an alternative policy gradient estimator that exploits the knowledge of actions being clipped to reduce the variance in estimation. We prove that CAPG is unbias...

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

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