default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxence Reberol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Maxence Reberol:
Maillages hex-dominants : génération, simulation et évaluation. (Hex-dominant meshes : generation, simulation and evaluation). University of Lorraine, Nancy, France, 2018
Journal Articles
- 2023
- [j6]Maxence Reberol
, Kilian Verhetsel, François Henrotte, David Bommes, Jean-François Remacle:
Robust Topological Construction of All-hexahedral Boundary Layer Meshes. ACM Trans. Math. Softw. 49(1): 2:1-2:32 (2023) - 2022
- [j5]François Protais, Maxence Reberol, Nicolas Ray, Etienne Corman, Franck Ledoux, Dmitry Sokolov:
Robust Quantization for Polycube Maps. Comput. Aided Des. 150: 103321 (2022) - [j4]Pierre-Alexandre Beaufort, Maxence Reberol, Denis Kalmykov, Heng Liu, Franck Ledoux, David Bommes:
Hex Me If You Can. Comput. Graph. Forum 41(5): 125-134 (2022) - [j3]Christos Georgiadis, Maxence Reberol, Jean-François Remacle:
Indirect all-quadrilateral meshing based on bipartite topological labeling. Eng. Comput. 38(5): 4731-4747 (2022) - 2018
- [j2]Nicolas Ray, Dmitry Sokolov, Maxence Reberol, Franck Ledoux, Bruno Lévy:
Hex-dominant meshing: Mind the gap! Comput. Aided Des. 102: 94-103 (2018) - [j1]Maxence Reberol, Bruno Lévy:
Computing the Distance between Two Finite Element Solutions Defined on Different 3D Meshes on a GPU. SIAM J. Sci. Comput. 40(1) (2018)
Informal and Other Publications
- 2021
- [i7]Jovana Jezdimirovic, Alexandre Chemin, Maxence Reberol, François Henrotte, Jean-François Remacle:
Quad layouts with high valence singularities for flexible quad meshing. CoRR abs/2103.02939 (2021) - [i6]Maxence Reberol, Christos Georgiadis, Jean-François Remacle:
Quasi-structured quadrilateral meshing in Gmsh - a robust pipeline for complex CAD models. CoRR abs/2103.04652 (2021) - [i5]Mattéo Couplet, Maxence Reberol, Jean-François Remacle:
Generation of High-Order Coarse Quad Meshes on CAD Models via Integer Linear Programming. CoRR abs/2108.02635 (2021) - [i4]Pierre-Alexandre Beaufort, Maxence Reberol, Heng Liu, Franck Ledoux, David Bommes:
Hex Me If You Can. CoRR abs/2111.10295 (2021) - 2020
- [i3]Alexis Macq, Maxence Reberol, François Henrotte, Pierre-Alexandre Beaufort, Alexandre Chemin, Jean-François Remacle, Jean Van Schaftingen:
Ginzburg-Landau energy and placement of singularities in generated cross fields. CoRR abs/2010.16381 (2020) - 2019
- [i2]Maxence Reberol, Alexandre Chemin, Jean-François Remacle:
Multiple Approaches to Frame Field Correction for CAD Models. CoRR abs/1912.01248 (2019) - 2016
- [i1]Maxence Reberol, Bruno Lévy:
Low-order continuous finite element spaces on hybrid non-conforming hexahedral-tetrahedral meshes. CoRR abs/1605.02626 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
