نتایج جستجو برای: directional subdividing

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

1995
Hartmut Prautzsch

This paper gives an analysis of surfaces generated by subdividing control nets of arbitrary topology We assume that the underlying subdivision al gorithm is stationary on the regular parts of the control nets and described by a matrix iteration around an extraordinary point For these subdivision schemes we derive conditions on the spectrum of the matrix and its gener alized eigenvectors such th...

2006
Muhammad Aurangzeb Ahmad

DEFINITION Binary space partitioning (BSP) is a technique for recursively subdividing a space into convex sets by hyperplanes. The subdivision can be represented by means of a tree data structure known as a BSP tree. A BSP tree is thus a Point Access Method. Each node in a BSP tree represents a hyperplane which divides the space into two halves. It also contains references to two nodes which re...

2017
T. Gangopadhyay

1. Abelson and diSessa, Turtle Geometry, MIT Press, 1992 2. Erdely, D. http://www.bridgesmathart.org/art exhibits/bridges2007/erdely.html. 3. Gangopadhyay, T. On an alternate construction method for generating spidrons and new tiling patterns generated by them, International journal of Computer Applications, Volume 160, number 3, 2017. 4. Gangopadhyay, T. On subdividing regular polygons using s...

Journal: :NeuroImage 2006
Rahul S Desikan Florent Ségonne Bruce Fischl Brian T Quinn Bradford C Dickerson Deborah Blacker Randy L Buckner Anders M Dale R Paul Maguire Bradley T Hyman Marilyn S Albert Ronald J Killiany

In this study, we have assessed the validity and reliability of an automated labeling system that we have developed for subdividing the human cerebral cortex on magnetic resonance images into gyral based regions of interest (ROIs). Using a dataset of 40 MRI scans we manually identified 34 cortical ROIs in each of the individual hemispheres. This information was then encoded in the form of an at...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس - دانشکده مهندسی 1387

abstract this paper discusses several commonly used models for strategic marketing¹ including market environmental analysis methods (i.e. swot and pest analysis) and strategic marketing tools and techniques (i.e. boston matrix and shell directional policy matrix)and shows how these models may help a firm to achieve its strategic goals. at first, the main reason for doing this research is de...

2004
VINAY KOLAR Nael Abu-Ghazaleh

Directional antennas have been proposed to improve the performance and capacity of Wireless MAC protocols for use in Mobile Ad hoc Networks (MANETs). Such antennas focus their beams in the direction of their receiver, allowing more of the signal power to be used in the direction of the transmission and simultaneously reducing the interference in other directions. However, several challenges and...

Journal: :E3S web of conferences 2021

The tourists’ value of traditional village representing personal values, influences the behavior deeply. This paper, with soft ladder method MEC theory from perspective tourist, studies tourists born in 60s, 70s, 80s, and 90s villages Hongcun Xidi, which indicates 39 chains, reveals 11 important attributes Huizhou villages, 16 tourism results, 9 types values. With constructing a sustainable dev...

2007
Emad Shihab

In this project report, we design a MAC protocol for direction-t0-directional (DtDMAC) transmission. We study the issues that face this type of transmission and then design an efficient protocol that is derived from the IEEE 802.11 DCF MAC protocol to address these issues. We present some preliminary simulation results that prove the feasibility of the proposed protocol.

Journal: :Journal of Graph Theory 2011
Tsai-Lien Wong Xuding Zhu

A graph G = (V, E) is called (k, k′)-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, and assigns to each edge e a set L(e) of k′ real numbers, there is a mapping f : V ∪ E → R such that f(y) ∈ L(y) for any y ∈ V ∪ E and for any two adjacent vertices x, x′, ∑ e∈E(x) f(e)+f(x) 6= ∑ e∈E(x′) f(e)+f(x ′). We ...

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

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