نتایج جستجو برای: bounding volume

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

2015
Peter Gottschalk David A. Green

In the large literature on polarization in the wage and employment structure, arguments about shifts in relative demands for different task based groups have been built on comparisons of movements in employment and wages. In particular, increases in both wages and employment in cognitive task occupations relative to routine task occupations are the basis for arguments that Information Technolog...

1999
Ernst Huber

An improved algorithm for the computation of the intersection curve of two general parametric surfaces is presented. The introduced subdivision algorithm follows a divide-and-conquer-approach. For each pair of patches, it rst checks if the corresponding bounding volumes intersect. If they intersect, then it tries to nd dispensable parts of one patch (and the corresponding parts in the parameter...

Journal: :Comput. Sci. Inf. Syst. 2010
Xiaopeng Wei Boxiang Xiao Qiang Zhang

A retrieval method for human Mocap (Motion Capture) data based on biomimetic pattern recognition is presented in this paper. BVH rotation channels are extracted as features of motion for both the retrieval instance and the motion data. Several hyper sausage neurons are constructed according to the retrieval instance, and the trained domain covered by these hyper sausage neurons can be considere...

Journal: :Comput. Graph. Forum 2001
Michael Meißner Dirk Bartz R. Günther Wolfgang Straßer

We present a new visibility driven rasterization scheme that significantly increases the rendering performance of modern graphic subsystems. Instead of rasterizing, texturing, lighting, and depth-testing each individual pixel, we introduce a two-level visibility mask within the rasterization stage which facilitates the removal of groups of pixels and triangles from rasterization and subsequent ...

2003
Kazumasa Yamazawa Naokazu Yokoya

2. DETECTING MOVING OBJECTS This paper describes a new method for detecting moving objects with an omnidirectional camera. The proposed method uses a fixed omnidirectional camera which can acquire images surrounding the camera and a background subtraction technique based on adaptively updating background images. In subtracting the background image from the input image, we consider the oscillati...

2014
P. CHRISTOPHER L. WRIGHT

We define the notion of valuation on simplicial maps between geometric realizations of simplicial complexes in R. Valuations on simplicial maps are analogous to valuations on sets. In particular, we define the Lefschetz volumes, which are analogous to the intrinsic volumes of subsets of R. Our definition not only provides a generalization of the Lefschetz number, but also yields a Hadwigerstyle...

Journal: :J. Comb. Theory, Ser. B 2015
Guy Moshkovitz Asaf Shapira

Let Wn(p, q) denote the minimum number of edges in an n× n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is added, a new copy of Kp,q is created. The problem of bounding Wn(p, q), and its natural hypergraph generalization, was introduced by Balogh, Bollobá...

2008
Daniel Dantchev Joseph Rudnick

We study critical point finite-size effects in the case of the susceptibility of a film in which interactions are characterized by a van der Waals-type power law tail. The geometry is appropriate to a slab-like system with two bounding surfaces. Boundary conditions are consistent with surfaces that both prefer the same phase in the low temperature, or broken symmetry, state. We take into accoun...

Journal: :Oper. Res. Lett. 2009
Nebojsa Gvozdenovic Monique Laurent Frank Vallentin

Lovász and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for 0/1 linear programming problems. We revisit these two constructions and propose two new, blockdiagonal hierarchies, which are at least as strong as the Lovász–Schrijver hierarchy, but less costly to compute. We report experimental results for the stable set problem of Paley graphs. © 2008 ...

Journal: :IEEE Trans. Vis. Comput. Graph. 1998
Wolfgang Stuerzlinger

This paper presents a new approach to rendering triangular algebraic free form surfaces. A hierarchical subdivision of the surface with associated tight bounding volumes provides for quick identification of the surface regions likely to be hit by a ray. For each leaf of the hierarchy an approximation to the corresponding surface region is stored. The approximation is used to compute a good star...

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

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