Author image not provided
 Guillem Borrell

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.00
Citation Count2
Publication count2
Publication years2011-2016
Available for download1
Average downloads per article102.00
Downloads (cumulative)102
Downloads (12 Months)35
Downloads (6 Weeks)4
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
June 2016 ACM Transactions on Mathematical Software (TOMS): Volume 42 Issue 4, July 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 35,   Downloads (Overall): 102

Full text available: PDFPDF
A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a structured-collocated grid and does not require any triangulation of the data. This makes the algorithm ...
Keywords: Euler characteristic, Genus, coherent structures, turbulence, turbulent/nonturbulent interface, voxels

2
September 2011 EuroMPI'11: Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

A hybrid OpenMP-MPI code has been developed and optimized for Blue Gene/P in order to perform a direct numerical simulation of a zero-pressure-gradient turbulent boundary layer at high Reynolds numbers. OpenMP is becoming the standard application programming interface for shared memory platforms, offering simplicity and portability. For architectures with limiting ...
Keywords: MPI, openMP, data locality, blocking, node topology



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us