Filters








292 Hits in 7.0 sec

A highly scalable massively parallel fast marching method for the Eikonal equation

Jianming Yang, Frederick Stern
2017 Journal of Computational Physics  
It is long deemed inherently sequential and an efficient parallel algorithm applicable to large-scale practical applications is not available in the literature.  ...  The fast marching method is a widely used numerical method for solving the Eikonal equation arising from a variety of scientific and engineering fields.  ...  Developed with serious large-scale practical applications (e.g., [7] and [1] , among others) in mind, this massively parallel fast marching method can give a remarkable parallel performance on billion-point  ... 
doi:10.1016/j.jcp.2016.12.012 fatcat:hjzigmv44zfcxbic4zlodo53ya

waLBerla: A block-structured high-performance framework for multiphysics simulations [article]

Martin Bauer, Sebastian Eibl, Christian Godenschwager, Nils Kohl, Michael Kuron, Christoph Rettinger, Florian Schornbaum, Christoph Schwarzmeier, Dominik Thönnes, Harald Köstler, Ulrich Rüde
2019 arXiv   pre-print
Multiple levels of parallelism on the core, on the compute node, and between nodes need to be exploited to make full use of the system.  ...  The block-structured domain partitioning is flexible enough to handle complex geometries, while the structured grid within each block allows for highly efficient implementations of stencil-based algorithms  ...  Acknowledgements The authors thank Daniela Anderl, Dominik Bartuschat As waLBerla is designed for massively parallel high performance computing, access to supercomputing facilities is of essential importance  ... 
arXiv:1909.13772v1 fatcat:b2iwdbbugjeebk3diazleysedi

Cache-Efficient Parallel Isosurface Extraction for Shared Cache Multicores [article]

Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin
2010 Eurographics Symposium on Parallel Graphics and Visualization  
We propose two shared cache aware parallel isosurface algorithms, one based on marching tetrahedra, and one using a min-max tree as acceleration data structure.  ...  The algorithms are based on the FastCOL cache-oblivious data layout for irregular meshes.  ...  We propose two versions of this isosurface parallel algorithm, one based on the marching tetrahedra (MT), and one using a min-max tree as acceleration data structure.  ... 
doi:10.2312/egpgv/egpgv10/081-090 fatcat:j7fjz2zkbvgzblbra4nw45umsi

Parallel Algorithms for Volumetric Surface Construction [chapter]

Joseph JaJa, Qingmin Shi, Amitabh Varshney
2007 Handbook of Parallel Computing  
We present a general framework for evaluating parallel isosurface extraction algorithms and describe the related best known parallel algorithms.  ...  particular focus on out-of-core techniques.  ...  For large scale data sets, the interactive rendering of isosurfaces is quite challenging and requires some form of extra hardware support either through parallel processing on a multiprocessor or through  ... 
doi:10.1201/9781420011296.ch27 fatcat:ztjtorlnnfdwdnysc57zywcpo4

Isosurface extraction and interpretation on very large datasets in geophysics

Guilhem Dupuy, Bruno Jobard, Sebastion Guillon, Noomame Keskes, Dimitri Komatitsch
2008 Proceedings of the 2008 ACM symposium on Solid and physical modeling - SPM '08  
We present in this paper a parallel, bloc-wise extension of the tandem algorithm [Attali et al. 2005] , which simplifies on the fly an isosurface being extracted.  ...  We show several results of our parallel algorithm applied on a 7000×1600×2000 geophysics dataset.  ...  Introduction Surface reconstruction for shape modeling is widely used in a large variety of domains (medicine, geophysics, ...). The marching cubes algorithm, introduced by Lorensen and al.  ... 
doi:10.1145/1364901.1364932 dblp:conf/sma/DupuyJGKK08 fatcat:fmj7jspv7vbx3cho2kepmfszxe

Parallel visualization on large clusters using MapReduce

Huy T. Vo, Jonathan Bronson, Brian Summa, Joao L.D. Comba, Juliana Freire, Bill Howe, Valerio Pascucci, Claudio T. Silva
2011 2011 IEEE Symposium on Large Data Analysis and Visualization  
With the capability of sustaining high I/O rate with fault-tolerance, MapReduce methods can be used as tools for quickly exploring large datasets with isosurfacing and rendering in a batch-oriented manner  ...  However, exploratory visualization systems are increasingly expected to support scalable data manipulation, restructuring, and querying capabilities in addition to core visualization algorithms.  ...  Our MapReduce-based algorithm for isosurface extraction is based on the Marching Cubes algorithm [26] , which is the de-facto standard for isosurface extraction due to its efficiency and robustness.  ... 
doi:10.1109/ldav.2011.6092321 dblp:conf/ldav/VoBSCFHPS11 fatcat:o7he5jap75abdnh7iumdbmhcyu

Three-Dimensional Microwave Imaging: Fast and Accurate Computations with Block Resolution Algorithms

Corentin Friedrich, Sébastien Bourguignon, Jérôme Idier, Yves Goussard
2020 Sensors  
Since all such systems involve the same matrix, we propose a block inversion strategy, based on the block-biconjugate gradient stabilized (BiCGStab) algorithm, with efficient implementations specific to  ...  Each evaluation of the cost function and of its gradient requires the resolution of as many high-dimensional linear systems as the number of incident fields, which represents a large amount of computations  ...  Acknowledgments: The authors would like to thank Patrick Chaumet, from the Fresnel Institute (Marseille, France), for granting access to the Fresnel database and giving us valuable advice about data capture  ... 
doi:10.3390/s20216282 pmid:33158198 pmcid:PMC7663225 fatcat:xmqwyx6bqnfafhkw2wuszlhnfy

Parallel extraction and simplification of large isosurfaces using an extended tandem algorithm

Guilhem Dupuy, Bruno Jobard, Sebastien Guillon, Noomane Keskes, Dimitri Komatitsch
2010 Computer-Aided Design  
We present a parallel, bloc-wise extension of the tandem algorithm [1], which simplifies on the fly an isosurface being extracted.  ...  We show several results of our parallel algorithm applied on a geophysical dataset of size 7000×1600×2000.  ...  We propose a parallel algorithm adapted to this kind of architecture that is composed of workers and a worker manager.  ... 
doi:10.1016/j.cad.2009.04.016 fatcat:c4kmywqx7bdxdbux42g2f4qs3m

A survey of the marching cubes algorithm

Timothy S. Newman, Hong Yi
2006 Computers & graphics  
Computer Graphics 1987; 21(4):163-9], a well-known cell-by-cell method for extraction of isosurfaces from scalar volumetric data sets, is presented.  ...  A survey of the development of the marching cubes algorithm [W. Lorensen, H. Cline, Marching cubes: a high resolution 3D surface construction algorithm.  ...  We also are grateful for the helpful suggestions of the reviewers and other colleagues, including the ideas that have arisen from discussions with J. Brad Byrd, Suk Seo, and Huijuan Zhang.  ... 
doi:10.1016/j.cag.2006.07.021 fatcat:6bzbzm5vszg4lozbqyctt3etge

Flying edges: A high-performance scalable isocontouring algorithm

William Schroeder, Rob Maynard, Berk Geveci
2015 2015 IEEE 5th Symposium on Large Data Analysis and Visualization (LDAV)  
With the emergence of large data and parallel architectures, a rethinking of isocontouring and other visualization algorithms is necessary to take full advantage of modern computing hardware.  ...  To this end we have developed a high-performance isocontouring algorithm for structured data that is designed to be inherently scalable.  ...  ACKNOWLEDGEMENTS This effort is part of an overall vision which we refer to as VTK-m, in which critical algorithms in the VTK system are extended towards massive multi-core parallelism.  ... 
doi:10.1109/ldav.2015.7348069 dblp:conf/ldav/SchroederMG15 fatcat:s257dql77negjosyctlor6a5a4

Moving Least-Squares Reconstruction of Large Models with GPUs

Bruce Merry, James Gain, Patrick Marais
2014 IEEE Transactions on Visualization and Computer Graphics  
This independence allows the algorithm to be parallelized using multiple GPUs, either in a single machine or a cluster.  ...  It also allows data sets with billions of point samples to be processed on a standard desktop PC.  ...  ACKNOWLEDGMENTS We would like to thank the African Cultural Heritage and Landscape Database (particularly Heinz Rüther and Roshan Bhurtha) and the Visual Computing Lab ISTI-CNR Pisa for providing data.  ... 
doi:10.1109/tvcg.2013.118 pmid:24356367 fatcat:rytvtwpu2bggplyz5m2xbkggje

Interactive ray tracing for volume visualization

S. Parker, M. Parker, Y. Livnat, P.-P. Sloan, C. Hansen, P. Shirley
1999 IEEE Transactions on Visualization and Computer Graphics  
These optimizations are used in three separate visualization algorithms: isosurfacing of rectilinear data, isosurfacing of unstructured data, and maximum-intensity projection on rectilinear data.  ...  Although this method has high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end parallel systems.  ...  ACKNOWLEDGMENTS Thanks to Matthew Bane and Michelle Miller for comments on the paper.  ... 
doi:10.1109/2945.795215 fatcat:5ej6nxdr6jfnnnk2aecmfsxd3i

Interactive ray tracing for volume visualization

Steven Parker, Michael Parker, Yarden Livnat, Peter-Pike Sloan, Charles Hansen, Peter Shirley
2005 ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05  
These optimizations are used in three separate visualization algorithms: isosurfacing of rectilinear data, isosurfacing of unstructured data, and maximum-intensity projection on rectilinear data.  ...  Although this method has high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end parallel systems.  ...  ACKNOWLEDGMENTS Thanks to Matthew Bane and Michelle Miller for comments on the paper.  ... 
doi:10.1145/1198555.1198754 dblp:conf/siggraph/ParkerPLSHS05 fatcat:asswnzhfxfdnzl4brmpbmx6qpi

CUDA-based triangulations of convolution molecular surfaces

Sérgio Dias, Kuldeep Bora, Abel Gomes
2010 Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing - HPDC '10  
Our triangulation algorithm for molecular surfaces is based on a multi-threaded, parallel version of the Marching Cubes (MC) algorithm.  ...  However, the input of our algorithm is not the volume dataset of a given molecule as usual for Marching Cubes, but the atom centers provided by the PDB file of such a molecule.  ...  Interestingly, most parallelized isosurfacing algorithms use the SIMD (Single Instruction, Multiple Data) architecture and also the MIMD (Multiple Instructions, Multiple Data) architecture.  ... 
doi:10.1145/1851476.1851553 dblp:conf/hpdc/DiasBG10 fatcat:chkrgki3ljgxdjjzozsv5nbkda

Coherent multiresolution isosurface ray tracing

Aaron M. Knoll, Ingo Wald, Charles D. Hansen
2008 The Visual Computer  
We implement and evaluate a fast ray tracing method for rendering large structured volumes. Input data is compressed into an octree, enabling residency in CPU main memory.  ...  We achieve higher performance with lesser footprint than previous isosurface ray tracers, and deliver large frame buffers, smooth gradient normals and shadows at relatively lesser cost.  ...  Although large data access can be achieved through out-of-core techniques, for complex scenes the direct volume rendering algorithm has difficulty rendering a precise isosurface, given a limited number  ... 
doi:10.1007/s00371-008-0215-2 fatcat:dh3e3qazlrbn5dey6w6amhjcdi
« Previous Showing results 1 — 15 out of 292 results