1,550 Hits in 5.9 sec

Easy integral surfaces

Tony McLoughlin, Robert S. Laramee, Eugene Zhang
2009 Computer Graphics International on - CGI '09  
We introduce a novel algorithm for the construction of stream and path surfaces that is fast, simple and does not rely on any complicated data structures or surface parameterization, thus making it suitable  ...  We demonstrate the technique on a series of simulation data sets and show that a number of benefits stem naturally from this approach including: easy timelines and timeribbons, easy stream arrows and easy  ...  Easy Stream and Path Arrows faces. They involve the use of surface data structures that enable fast searching of the geometry in order to find a suitable place to map texture-based arrows.  ... 
doi:10.1145/1629739.1629748 dblp:conf/cgi/McLoughlinLZ09 fatcat:eemitue3une5pmffro5jvvkhp4

Efficient GPU rendering of subdivision surfaces using adaptive quadtrees

Wade Brainerd, Tim Foley, Manuel Kraemer, Henry Moreton, Matthias Nießner
2016 ACM Transactions on Graphics  
In addition, our streaming formulation makes it easier to integrate subdivision surfaces into applications and shader code written for polygonal models.  ...  Our approach makes tessellated subdivision surfaces easy to integrate into modern video game rendering (right).  ...  Acknowledgments The authors would also like to thank Akimitsu Hogge for ideas and useful discussion, Christer Ericson, John Spitzer, and Aaron Lefohn for their support of this work, and the anonymous reviewers  ... 
doi:10.1145/2897824.2925874 fatcat:sdf3vn5t2jaldfxjqziirobkga

Subdivision surface watermarking

Guillaume Lavoué, Florence Denis, Florent Dupont
2007 Computers & graphics  
Since the watermarked surface can be attacked in a subdivided version, we have introduced an algorithm to retrieve the control polyhedron, starting from a subdivided, attacked version.  ...  This paper presents a robust non-blind watermarking scheme for subdivision surfaces. The algorithm works in the frequency domain, by modulating spectral coefficients of the subdivision control mesh.  ...  Moreover, the watermark insertion and extraction mechanisms, based on spectral coefficient modulation, are very simple and thus also quite fast.  ... 
doi:10.1016/j.cag.2007.01.022 fatcat:uggyam3hxvgt3o3ykvi2ik7v4q

Large-Scale Vector Data Visualization using High Performance Computing

Ahmed Safwat Ali, Ashraf Saad Hussein, Mohamed Fahmy Tolba, Ahmed Hassan Yousef
2011 Journal of Software  
In computational flow visualization, integration based geometric flow visualization is often used to explore the flow field structure.  ...  The challenge is to design and implement techniques that meet these complex requirements and balance the conflicts between them.  ...  Stream surface visualization The implementation of the proposed technique for stream surface visualization is based on the easy integral stream surface algorithm introduced by McLoughlin [23] .  ... 
doi:10.4304/jsw.6.2.298-305 fatcat:d7wtdltorrdbfgtszdnwkvg3h4

Analytical solutions for sketch-based convolution surface modeling on the GPU

Xiaoqiang Zhu, Xiaogang Jin, Shengjun Liu, Hanli Zhao
2011 The Visual Computer  
We convert the double integral over a planar polygon into a simple integral along the contour of the polygon based on Green's theorem, which reduces the computational cost and allows for efficient parallel  ...  For finite support kernel functions, a skeleton clipping algorithm is presented to compute the valid skeletons.  ...  Results Our prototype system is tested on a PC with a 2.67 GHz Intel Core 2 Quad 9400 CPU (only 1 core is used) with 3 GB main memory, and an NVIDIA GeForce GTX 260 GPU (with 27 stream multiprocessors)  ... 
doi:10.1007/s00371-011-0662-z fatcat:2pflrrli5zfd5mxah2bwkxfx6m

Automatic generation of multiblock decompositions of surfaces

Harold J. Fogg, Cecil G. Armstrong, Trevor T. Robinson
2015 International Journal for Numerical Methods in Engineering  
In 2-D, a few methods are established for creating quadrilateral (quad) meshes such as paving [8, 9] , Cartesian grid [10], submapping [11] , and medial-axis based decomposition methods [12, 13] but they  ...  The general solution strategy is based around using a four-way symmetry vector-field, called a cross-field, to describe the local mesh orientation on a triangulation of the surface.  ...  A version of the Fast Marching method is used for this which is based on the finite element approach described in [47] . Pseudo-code of the algorithm is given in Alg. 2.  ... 
doi:10.1002/nme.4825 fatcat:yamj3uuylzcjxlsod2vczpency

MicroRNAs in lipid metabolism

Carlos Fernández-Hernando, Yajaira Suárez, Katey J Rayner, Kathryn J Moore
2011 Current Opinion in Lipidology  
In addition to classic transcriptional regulation of cholesterol metabolism (e.g. by SREBP and LXR), members of a class of noncoding RNAs termed miRNAs have now been identified to be potent post-transcriptional  ...  This review summarizes the evidence for a critical role of miRNAs in regulating lipid metabolism. Lipid metabolism is tightly regulated at the cellular level.  ...  Easy Integral Surfaces: A Fast, Quad-based Stream and Path Surface Algorithm.  ... 
doi:10.1097/mol.0b013e3283428d9d pmid:21178770 pmcid:PMC3096067 fatcat:lubmprgykzgnvj5el5vf4q5b7m

Hand-guided 3D surface acquisition by combining simple light sectioning with real-time algorithms [article]

Oliver Arold, Svenja Ettl, Florian Willomitzer, Gerd Häusler
2014 arXiv   pre-print
We present a sensor principle called "Flying Triangulation" which avoids an elaborate "stop-and-go" procedure. It combines a low-cost classical light-section sensor with an algorithmic pipeline.  ...  Often, views from all around the object have to be acquired for a full 3D description of the object surface.  ...  A continuous stream of sparse 3D views is acquired by a hand-guided sensor based on light sectioning.  ... 
arXiv:1401.1946v1 fatcat:ko2gph3ncrcnroq3l4q2uo6qhi

GPU-accelerated high-quality hidden surface removal

Daniel Wexler, Larry Gritz, Eric Enderton, Jonathan Rice
2005 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware - HWWS '05  
We present a GPU-based hidden-surface algorithm that implements all these features. The algorithm is Reyeslike but uses regular sampling and multiple passes.  ...  Transparency is implemented by depth peeling, made more efficient by opacity thresholding and a new method called z batches. We discuss performance and some design trade-offs.  ...  But as mentioned earlier, the GPU's ability to do relatively fast grid occlusion allows us to cull an extra 10-20% of points, versus a typical Reyes CPU algorithm.  ... 
doi:10.1145/1071866.1071868 fatcat:sz4mqpkytrfg5fpfddzkvbzztm

Flow Charts: Visualization of Vector Fields on Arbitrary Surfaces

Guo-Shi Li, X. Tricoche, D. Weiskopf, C.D. Hansen
2008 IEEE Transactions on Visualization and Computer Graphics  
In this scheme the surface and its associated flow are segmented into overlapping patches which are then parameterized and packed in the texture domain.  ...  We introduce a novel flow visualization method called Flow Charts, which uses a texture atlas approach for the visualization of flows defined over curved surfaces.  ...  algorithms to curved surfaces.  ... 
doi:10.1109/tvcg.2008.58 pmid:18599918 pmcid:PMC2782580 fatcat:6ny5aeinfzc3hp3smzgaq75fby

Interactive GPU-based "Visulation" and Structure Analysis of 3-D Implicit Surfaces for Seismic Interpretation

Benjamin J. Kadlec
2010 Geophysics  
2009 This thesis entitled: Interactive GPU-based "Visulation" and Structure Analysis of 3-D Implicit Surfaces for Seismic Interpretation written by Benjamin James Kadlec has been approved for the Department  ...  above mentioned discipline. iii Kadlec, Benjamin James (Ph.D., Computer Science): Interactive GPU-Based "Visulation" and Structure Analysis of 3D Implicit Surfaces for Seismic Interpretation Thesis directed  ...  A.2 Research Schedule  ... 
doi:10.1190/1.3426303 fatcat:ecwwmgogvvdr5dxvkql7bbuvuu

Smart Transparency for Illustrative Visualization of Complex Flow Surfaces

Robert Carnecky, Raphael Fuchs, Stephanie Mehl, Yun Jang, Ronald Peikert
2013 IEEE Transactions on Visualization and Computer Graphics  
Based on this framework we present an efficient algorithm for a non-local transparency enhancement that creates expressive renderings of transparent surfaces.  ...  This novel data structure combines the ideas of the A-and G-buffers to store a list of all surface layers for each pixel.  ...  [14] present an interesting algorithm based on depth-peeling for the image-based rendering of intersecting surfaces.  ... 
doi:10.1109/tvcg.2012.159 pmid:22802119 fatcat:cvnwen5l2zdwff22fkk7q6xxv4

Particle Level Set Advection for the Interactive Visualization of Unsteady 3D Flow

Nicolas Cuntz, Andreas Kolb, Robert Strzodka, Daniel Weiskopf
2008 Computer graphics forum (Print)  
Our work demonstrates that the PLS technique can be adapted to volumetric dye advection via streak volumes, and to the visualization by time surfaces and path volumes.  ...  Grid-based level sets offer a good global representation but suffer from numerical diffusion of surface detail, whereas particlebased methods preserve details more accurately but introduce the problem  ...  Even the simpler problem of stream surfaces already requires advanced algorithms to handle these issues [Hul92,GTS * 04]; point-based representations of stream surfaces and path surfaces avoid issues of  ... 
doi:10.1111/j.1467-8659.2008.01200.x fatcat:ccl6w736jnhdpeunoy7w3o5o3i

Pseudo-Immersive Real-Time Display of 3D Scenes on Mobile Devices

Ming Li, Arne Schmitz, Leif Kobbelt
2011 2011 International Conference on 3D Imaging, Modeling, Processing, Visualization and Transmission  
Hence, we propose a client-server system, where the processing of the complex scene is performed on a server and the resulting data is streamed to the mobile device.  ...  Besides designing the overall system with a render-server, 3D display client, and real-time face/pose detection, our main technical contribution is a highly efficient algorithm that decomposes a frame  ...  Examples of our 2.5D mesh generation using TOF and structured light camera inputs. Left to right: RGB image, depth-image, Monotonic Line Growing, Inverse Bresenham, 2.5D mesh.  ... 
doi:10.1109/3dimpvt.2011.15 dblp:conf/3dim/LiSK11 fatcat:a2tzrkfqqzejxnun2xukc4inpi

A Survey of General-Purpose Computation on Graphics Hardware [article]

John D. Owens, David Luebke, Naga Govindaraju, Mark Harris, Jens Krüger, Aaron E. Lefohn, Timothy J. Purcell
2005 Eurographics State of the Art Reports  
We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques.  ...  in a wide variety of application domains.  ...  Acknowledgements Thanks to Ian Buck, Jeff Bolz, Daniel Horn, Marc Pollefeys, and Robert Strzodka for their thoughtful comments, and to the anonymous reviewers for their helpful and constructive criticism  ... 
doi:10.2312/egst.20051043 fatcat:7jved5a5v5ezjpvfgxtye5xscu
« Previous Showing results 1 — 15 out of 1,550 results