<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>tool &#8211; Hextreme</title>
	<atom:link href="https://www.hextreme.eu/tag/tool/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.hextreme.eu</link>
	<description>Hexahedral Mesh Generation in Real Time</description>
	<lastBuildDate>Wed, 07 Nov 2018 10:07:18 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	

<image>
	<url>https://www.hextreme.eu/wp-content/uploads/2018/11/cropped-erc-1-32x32.jpg</url>
	<title>tool &#8211; Hextreme</title>
	<link>https://www.hextreme.eu</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Paper: Computing cross fields, a PDE approach based on Ginzburg-Landau theory</title>
		<link>https://www.hextreme.eu/paper-computing-cross-fields-a-pde-approach-based-on-ginzburg-landau-theory/</link>
					<comments>https://www.hextreme.eu/paper-computing-cross-fields-a-pde-approach-based-on-ginzburg-landau-theory/#respond</comments>
		
		<dc:creator><![CDATA[Hextreme Staff]]></dc:creator>
		<pubDate>Tue, 24 Oct 2017 09:07:01 +0000</pubDate>
				<category><![CDATA[Paper]]></category>
		<category><![CDATA[cross fields]]></category>
		<category><![CDATA[Ginzburg-Landau]]></category>
		<category><![CDATA[tool]]></category>
		<guid isPermaLink="false">http://www.hextreme.eu/?p=2443</guid>

					<description><![CDATA[We developed an innovative way to compute cross fields in order to spawn points which are consistent with a square grid. The mathematical background is built step by step to highlight the meaningful use of Ginzburg-Landau functional. An interesting result is obtained over the sphere: the anti-cube. The computation is extended to asterisk fields for equilateral &#8230; <a href="https://www.hextreme.eu/paper-computing-cross-fields-a-pde-approach-based-on-ginzburg-landau-theory/" class="more-link">Continue reading <span class="screen-reader-text">Paper: Computing cross fields, a PDE approach based on Ginzburg-Landau theory</span></a>]]></description>
										<content:encoded><![CDATA[<p>We developed an innovative way to compute <strong>cross fields</strong> in order to spawn points which are consistent with a square grid. The mathematical background is built step by step to highlight the meaningful use of <strong>Ginzburg-Landau functional</strong>. An interesting result is obtained over the sphere: the <strong>anti-cube</strong>. The computation is extended to <strong>asterisk fields</strong> for equilateral triangular grid.</p>
<ul>
<li>The paper has been <a href="http://www.sciencedirect.com/science/article/pii/S1877705817343606">pub</a><a href="https://onlinelibrary.wiley.com/doi/abs/10.1002/nme.5987">Paper on Wiley Online Library</a><a href="http://www.sciencedirect.com/science/article/pii/S1877705817343606">lished</a> in Elsevier &#8211; Procedia Engineering (Volume 203, 201, Pages 219-231).</li>
<li>The C code will soon be available in <a href="http://gmsh.info/">Gmsh</a>.</li>
<li>This study has been funded by the <a href="http://onelab.info/wiki/ARC_WAVES_project">ARC WAVES 15/19-03</a>.</li>
</ul>
<p><img fetchpriority="high" decoding="async" class="alignnone size-full wp-image-2453" src="http://www.hextreme.eu/wp-content/uploads/2017/10/s_1.png" alt="" width="608" height="615" srcset="https://www.hextreme.eu/wp-content/uploads/2017/10/s_1.png 608w, https://www.hextreme.eu/wp-content/uploads/2017/10/s_1-297x300.png 297w, https://www.hextreme.eu/wp-content/uploads/2017/10/s_1-100x100.png 100w" sizes="(max-width: 608px) 100vw, 608px" /><img decoding="async" class="alignnone size-full wp-image-2473" src="http://www.hextreme.eu/wp-content/uploads/2017/10/s_3.png" alt="" width="604" height="595" srcset="https://www.hextreme.eu/wp-content/uploads/2017/10/s_3.png 604w, https://www.hextreme.eu/wp-content/uploads/2017/10/s_3-300x296.png 300w, https://www.hextreme.eu/wp-content/uploads/2017/10/s_3-100x100.png 100w" sizes="(max-width: 604px) 100vw, 604px" /></p>

<div id="zotpress-258182cc7d6177f34284608a9c635b2e" class="zp-Zotpress zp-Zotpress-Bib wp-block-group">

		<span class="ZP_API_USER_ID ZP_ATTR">765097</span>
		<span class="ZP_ITEM_KEY ZP_ATTR">{:Y9WTQNKA}</span>
		<span class="ZP_COLLECTION_ID ZP_ATTR"></span>
		<span class="ZP_TAG_ID ZP_ATTR"></span>
		<span class="ZP_AUTHOR ZP_ATTR"></span>
		<span class="ZP_YEAR ZP_ATTR"></span>
        <span class="ZP_ITEMTYPE ZP_ATTR"></span>
		<span class="ZP_INCLUSIVE ZP_ATTR">1</span>
		<span class="ZP_STYLE ZP_ATTR">petit-chicago-author-date</span>
		<span class="ZP_LIMIT ZP_ATTR">50</span>
		<span class="ZP_SORTBY ZP_ATTR">default</span>
		<span class="ZP_ORDER ZP_ATTR"></span>
		<span class="ZP_TITLE ZP_ATTR"></span>
		<span class="ZP_SHOWIMAGE ZP_ATTR"></span>
		<span class="ZP_SHOWTAGS ZP_ATTR"></span>
		<span class="ZP_DOWNLOADABLE ZP_ATTR"></span>
		<span class="ZP_NOTES ZP_ATTR"></span>
		<span class="ZP_ABSTRACT ZP_ATTR"></span>
		<span class="ZP_CITEABLE ZP_ATTR"></span>
		<span class="ZP_TARGET ZP_ATTR"></span>
		<span class="ZP_URLWRAP ZP_ATTR"></span>
		<span class="ZP_FORCENUM ZP_ATTR"></span>
        <span class="ZP_HIGHLIGHT ZP_ATTR"></span>
        <span class="ZP_POSTID ZP_ATTR">2443</span>
		<span class="ZOTPRESS_PLUGIN_URL ZP_ATTR">https://www.hextreme.eu/wp-content/plugins/zotpress/</span>

		<div class="zp-List loading">
			<div class="zp-SEO-Content">

			</div><!-- .zp-zp-SEO-Content -->
		</div><!-- .zp-List -->
	</div><!--.zp-Zotpress-->


]]></content:encoded>
					
					<wfw:commentRss>https://www.hextreme.eu/paper-computing-cross-fields-a-pde-approach-based-on-ginzburg-landau-theory/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>HXTSort</title>
		<link>https://www.hextreme.eu/hxtsort/</link>
					<comments>https://www.hextreme.eu/hxtsort/#respond</comments>
		
		<dc:creator><![CDATA[Hextreme Staff]]></dc:creator>
		<pubDate>Tue, 05 Sep 2017 13:50:39 +0000</pubDate>
				<category><![CDATA[Non classé]]></category>
		<category><![CDATA[sort]]></category>
		<category><![CDATA[tool]]></category>
		<guid isPermaLink="false">http://www.hextreme.eu/?p=1683</guid>

					<description><![CDATA[view on GitLab HXTSort is a single header library including lightning fast Parallel Radix Sort macros. It can sort 400 million integers per second on a laptop&#8217;s  i7-6700HQ and up to 1 billion integers per second on a Intel® Xeon Phi™  7210 ( 1.30GHz). &#160; It includes multiple  key-based algorithms for sorting data on any standard computer &#8230; <a href="https://www.hextreme.eu/hxtsort/" class="more-link">Continue reading <span class="screen-reader-text">HXTSort</span></a>]]></description>
										<content:encoded><![CDATA[<p><a href="https://git.immc.ucl.ac.be/hextreme/HXTSort">view on GitLab</a></p>
<p><figure id="attachment_2373" aria-describedby="caption-attachment-2373" style="width: 245px" class="wp-caption aligncenter"><a href="https://git.immc.ucl.ac.be/hextreme/HXTSort"><img decoding="async" class="wp-image-2373 " src="http://www.hextreme.eu/wp-content/uploads/2017/09/wm_no_bg-300x114.png" alt="view on gitlab" width="245" height="93" srcset="https://www.hextreme.eu/wp-content/uploads/2017/09/wm_no_bg-300x114.png 300w, https://www.hextreme.eu/wp-content/uploads/2017/09/wm_no_bg-768x291.png 768w, https://www.hextreme.eu/wp-content/uploads/2017/09/wm_no_bg-1024x388.png 1024w, https://www.hextreme.eu/wp-content/uploads/2017/09/wm_no_bg.png 1202w" sizes="(max-width: 245px) 100vw, 245px" /></a><figcaption id="caption-attachment-2373" class="wp-caption-text"><strong>HXTSort</strong> &#8211; <strong>H</strong>e<strong>xt</strong>reme <strong>Sort</strong>ing Library</figcaption></figure></p>
<p>HXTSort is a single header library including lightning fast <strong>Parallel Radix Sort</strong> macros.</p>
<p>It can sort 400 million integers per second on a laptop&#8217;s  <em>i7-6700HQ </em>and up to <strong>1 billion integers per second</strong> on a <em>Intel<b>®</b> Xeon Phi<img src="https://s.w.org/images/core/emoji/17.0.2/72x72/2122.png" alt="™" class="wp-smiley" style="height: 1em; max-height: 1em;" />  7210 ( 1.30GHz).</em></p>
<p>&nbsp;</p>
<p><figure id="attachment_2523" aria-describedby="caption-attachment-2523" style="width: 762px" class="wp-caption aligncenter"><img loading="lazy" decoding="async" class="wp-image-2523" src="http://www.hextreme.eu/wp-content/uploads/2017/09/HXTSort-1024x580.png" alt="HXTSort is a lot faster than qsort" width="762" height="432" srcset="https://www.hextreme.eu/wp-content/uploads/2017/09/HXTSort-1024x580.png 1024w, https://www.hextreme.eu/wp-content/uploads/2017/09/HXTSort-300x170.png 300w, https://www.hextreme.eu/wp-content/uploads/2017/09/HXTSort-768x435.png 768w, https://www.hextreme.eu/wp-content/uploads/2017/09/HXTSort.png 1525w" sizes="auto, (max-width: 762px) 100vw, 762px" /><figcaption id="caption-attachment-2523" class="wp-caption-text">Because HXTSORT32_UNIFORM does not always pick the best underlying algorithm on the core i7, we manually chose the best of LSB32 and PARALLEL_HYBRID32.</figcaption></figure></p>
<p>It includes multiple  key-based algorithms for sorting data on any standard computer (single-node SMPs). It could also be a very good core algorithm for a MPI merge sort implementation for Clusters.</p>
<p><img loading="lazy" decoding="async" class="alignnone size-large wp-image-1833" src="http://www.hextreme.eu/wp-content/uploads/2017/09/graph2-1-1024x451.png" alt="" width="525" height="231" srcset="https://www.hextreme.eu/wp-content/uploads/2017/09/graph2-1-1024x451.png 1024w, https://www.hextreme.eu/wp-content/uploads/2017/09/graph2-1-300x132.png 300w, https://www.hextreme.eu/wp-content/uploads/2017/09/graph2-1-768x338.png 768w" sizes="auto, (max-width: 525px) 100vw, 525px" /></p>
<hr />
<p>HXTSort will be used in our future Mesh Generation Library. A version of this library containing only a basic Mesher will be released soon.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://www.hextreme.eu/hxtsort/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Paper: Robust and efficient validation of the linear hexahedral element</title>
		<link>https://www.hextreme.eu/paper-robust-and-efficient-validation-of-the-linear-hexahedral-element/</link>
					<comments>https://www.hextreme.eu/paper-robust-and-efficient-validation-of-the-linear-hexahedral-element/#respond</comments>
		
		<dc:creator><![CDATA[Hextreme Staff]]></dc:creator>
		<pubDate>Sun, 11 Jun 2017 11:20:03 +0000</pubDate>
				<category><![CDATA[Paper]]></category>
		<category><![CDATA[hex]]></category>
		<category><![CDATA[tool]]></category>
		<category><![CDATA[validation]]></category>
		<guid isPermaLink="false">http://www.hextreme.eu/?p=1623</guid>

					<description><![CDATA[We present a method to compute the true validity of hexahedra in an efficient manner. More than 6 million hexahedra are analyzed on a single core per second. The paper is available on arXiv: arxiv.org/abs/1706.01613. The C++ code will soon be available in Gmsh. Input tetrahedral meshes are available here.]]></description>
										<content:encoded><![CDATA[<p>We present a method to compute the true validity of hexahedra in an efficient manner. More than 6 million hexahedra are analyzed on a single core per second.</p>
<ul>
<li>The paper is available on arXiv: <a href="https://arxiv.org/abs/1706.01613">arxiv.org/abs/1706.01613</a>.</li>
<li>The C++ code will soon be available in <a href="http://www.gmsh.info">Gmsh</a>.</li>
<li>Input tetrahedral meshes are available <a href="ftp://braque.mema.ucl.ac.be/tet-combination-data/">here</a>.</li>
</ul>
<p><img loading="lazy" decoding="async" class="alignnone wp-image-1633" src="http://www.hextreme.eu/wp-content/uploads/2017/06/hex1.png" alt="" width="250" height="250" srcset="https://www.hextreme.eu/wp-content/uploads/2017/06/hex1.png 600w, https://www.hextreme.eu/wp-content/uploads/2017/06/hex1-150x150.png 150w, https://www.hextreme.eu/wp-content/uploads/2017/06/hex1-300x300.png 300w, https://www.hextreme.eu/wp-content/uploads/2017/06/hex1-100x100.png 100w" sizes="auto, (max-width: 250px) 100vw, 250px" /></p>

<div id="zotpress-87231f9c46ad2fc50e89b29b94fbb942" class="zp-Zotpress zp-Zotpress-Bib wp-block-group">

		<span class="ZP_API_USER_ID ZP_ATTR">765097</span>
		<span class="ZP_ITEM_KEY ZP_ATTR">{:4KZ5B73N}</span>
		<span class="ZP_COLLECTION_ID ZP_ATTR"></span>
		<span class="ZP_TAG_ID ZP_ATTR"></span>
		<span class="ZP_AUTHOR ZP_ATTR"></span>
		<span class="ZP_YEAR ZP_ATTR"></span>
        <span class="ZP_ITEMTYPE ZP_ATTR"></span>
		<span class="ZP_INCLUSIVE ZP_ATTR">1</span>
		<span class="ZP_STYLE ZP_ATTR">petit-chicago-author-date</span>
		<span class="ZP_LIMIT ZP_ATTR">50</span>
		<span class="ZP_SORTBY ZP_ATTR">default</span>
		<span class="ZP_ORDER ZP_ATTR"></span>
		<span class="ZP_TITLE ZP_ATTR"></span>
		<span class="ZP_SHOWIMAGE ZP_ATTR"></span>
		<span class="ZP_SHOWTAGS ZP_ATTR"></span>
		<span class="ZP_DOWNLOADABLE ZP_ATTR"></span>
		<span class="ZP_NOTES ZP_ATTR"></span>
		<span class="ZP_ABSTRACT ZP_ATTR"></span>
		<span class="ZP_CITEABLE ZP_ATTR"></span>
		<span class="ZP_TARGET ZP_ATTR"></span>
		<span class="ZP_URLWRAP ZP_ATTR"></span>
		<span class="ZP_FORCENUM ZP_ATTR"></span>
        <span class="ZP_HIGHLIGHT ZP_ATTR"></span>
        <span class="ZP_POSTID ZP_ATTR">1623</span>
		<span class="ZOTPRESS_PLUGIN_URL ZP_ATTR">https://www.hextreme.eu/wp-content/plugins/zotpress/</span>

		<div class="zp-List loading">
			<div class="zp-SEO-Content">

			</div><!-- .zp-zp-SEO-Content -->
		</div><!-- .zp-List -->
	</div><!--.zp-Zotpress-->


]]></content:encoded>
					
					<wfw:commentRss>https://www.hextreme.eu/paper-robust-and-efficient-validation-of-the-linear-hexahedral-element/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
