نتایج جستجو برای: cutting trees

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

Journal: :Computer-Aided Design 2008
Mikola Lysenko Roshan D'Souza Ching-Kuan Shene

This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numerical robustness and O(n) output sensitive time complexity, while simultaneously admitting a straightforward implementation. To achieve these properties, we present two key algorithmic improvements. The first is a method ...

Journal: :bulletin of the iranian mathematical society 2013
m. javanian

we study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by devroye et. al (2011). in a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor ix_i floor$ where $x_0$, $ldots$ , $x_n$ is a sequence of i.i.d. random variables, with support in [0,...

Journal: :Environmental management 2003
Daniel Simberloff Maria Andrea Relva Martin Nunez

Isla Victoria (Nahuel Huapi National Park, Argentina), a large island dominated by native Nothofagus and Austrocedrus forest, has old plantations of many introduced tree species, some of which are famed invaders of native ecosystems elsewhere. There are also large populations of introduced deer and shrubs that may interact in a complex way with the introduced trees, as well as a recently arrive...

2014
Christopher M. Free Matthew Landis James Grogan Mark D. Schulze Marco Lentini Oliver Dünisch

Knowledge of tree age-size relationships is essential towards evaluating the sustainability of harvest regulations that include minimum diameter cutting limits and fixed-length cutting cycles. Although many tropical trees form annual growth rings and can be aged from discs or cores, destructive sampling is not always an option for valuable or threatened species. We used an individual-based popu...

Journal: :JIP 2012
Yoshifumi Manabe Tatsuaki Okamoto

This paper discusses cake-cutting protocols when the cake is a heterogeneous good, represented by an interval on the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Meta-envy-free means there is no envy on role assignments, that is, no party wants to exchange his/her role in the protocol with the one of any o...

2010
Yoshifumi Manabe Tatsuaki Okamoto

This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Though envy-freeness was considered to be one of the most important desirable properties, envy-freeness does not prevent envy about role a...

Journal: :Frontiers in insect science 2023

The grass-cutting ant Atta vollenweideri is well suited for studies examining the negative effect leaf-cutting ants have on livestock production in South American grasslands because they forage same plants as cattle. This study investigated impact of A. Argentinean rangelands. First, we assessed herbivory rates and its economic injury level (EIL). Second, using satellite imagery a region coveri...

Journal: :CoRR 2008
John Michael Robson

We consider lower bounds on the number of spanning trees of connected graphs with degree bounded by d. The question is of interest because such bounds may improve the analysis of the improvement produced by memorisation in the runtime of exponential algorithms. The value of interest is the constant βd such that all connected graphs with degree bound ed by d have at least β d spanning trees wher...

Journal: :Discrete & Computational Geometry 2010
Eynat Rafalin Diane L. Souvaine Csaba D. Tóth

We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1r -cutting is a covering of the space with simplices such that the interior of each simplex intersects at most n/r objects. For n pairwise disjoint disks in R and a parameter r ∈ N, we construct a 1r -cutting of size O(r). For n axis-a...

Journal: :Work 2012
Amaury Paulo de Souza Luciano José Minette André Luis Petean Sanches Emília Pio da Silva Valéria Antônia Justino Rodrigues Luciana Aparecida de Oliveira

There are several forest operations involved in Eucalyptus timber harvesting. This study was carried out during brush-cutting; tree felling, bucking, delimbing, piling and manual extraction operations, with the following objectives: a) analyzing, ergonomically, two systems of brush-cutting: one manual and the other semi-mechanized, using two different machines; b) ergonomically evaluating three...

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

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