Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 4 de 4
Filter
Add more filters










Database
Language
Publication year range
1.
IEEE Trans Vis Comput Graph ; 17(4): 466-74, 2011 Apr.
Article in English | MEDLINE | ID: mdl-20530816

ABSTRACT

Recent GPU algorithms for constructing spatial hierarchies have achieved promising performance for moderately complex models by using the breadth-first search (BFS) construction order. While being able to exploit the massive parallelism on the GPU, the BFS order also consumes excessive GPU memory, which becomes a serious issue for interactive applications involving very complex models with more than a few million triangles. In this paper, we propose to use the partial breadth-first search (PBFS) construction order to control memory consumption while maximizing performance. We apply the PBFS order to two hierarchy construction algorithms. The first algorithm is for kd-trees that automatically balances between the level of parallelism and intermediate memory usage. With PBFS, peak memory consumption during construction can be efficiently controlled without costly CPU-GPU data transfer. We also develop memory allocation strategies to effectively limit memory fragmentation. The resulting algorithm scales well with GPU memory and constructs kd-trees of models with millions of triangles at interactive rates on GPUs with 1 GB memory. Compared with existing algorithms, our algorithm is an order of magnitude more scalable for a given GPU memory bound. The second algorithm is for out-of-core bounding volume hierarchy (BVH) construction for very large scenes based on the PBFS construction order. At each iteration, all constructed nodes are dumped to the CPU memory, and the GPU memory is freed for the next iteration's use. In this way, the algorithm is able to build trees that are too large to be stored in the GPU memory. Experiments show that our algorithm can construct BVHs for scenes with up to 20 M triangles, several times larger than previous GPU algorithms.

2.
Plant Biol (Stuttg) ; 9(3): 357-65, 2007 May.
Article in English | MEDLINE | ID: mdl-17236100

ABSTRACT

This paper presents a detailed analysis of the PmSUC1 gene from plantago major, of its promoter activity in Arabidopsis, and of the tissue specific localization of the encoded protein in Plantago. PmSUC1 promoter activity was detected in the innermost layer of the inner integument (the endothel) of Arabidopsis plants expressing the gene of the green fluorescent protein (GFP) under the control of the PmSUC1 promoter. This promoter activity was confirmed with a PmSUC1-specific antiserum that identified the PmSUC1 protein in the endothel of Plantago and of Arabidopsis plants expressing the PmSUC1 gene under the control of its own promoter. PmSUC1 promoter activity and PmSUC1 protein were also detected in pollen grains during maturation inside the anthers and in pollen tubes during and after germination. These results demonstrate that PmSUC1 is involved in sucrose partitioning to the young embryo and to the developing pollen and growing pollen tube. In the innermost cell layer of the inner integument, a tissue that delivers nutrients to the endosperm and the embryo, PmSUC1 may catalyze the release of sucrose into the apoplast.


Subject(s)
Flowers/metabolism , Membrane Transport Proteins/metabolism , Plant Proteins/metabolism , Plantago/metabolism , Promoter Regions, Genetic/genetics , Sucrose/metabolism , Arabidopsis/genetics , Arabidopsis/metabolism , Blotting, Western , Exons , Flowers/genetics , Green Fluorescent Proteins/genetics , Green Fluorescent Proteins/metabolism , Immunohistochemistry , Introns , Membrane Transport Proteins/genetics , Microscopy, Confocal , Microscopy, Fluorescence , Plant Proteins/genetics , Plantago/genetics , Plants, Genetically Modified , Pollen/genetics , Pollen/metabolism , Pollen Tube/genetics , Pollen Tube/metabolism , Transcription, Genetic
SELECTION OF CITATIONS
SEARCH DETAIL
...