default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 33 matches
- 2006
- Frédéric Alauzet, Adrien Loseille, Alain Dervieux, Pascal J. Frey:
Multi-Dimensional Continuous Metric for Mesh Adaptation. IMR 2006: 191-214 - F. Betül Atalay, David M. Mount:
The Cost of Compatible Refinement of Simplex Decomposition Trees. IMR 2006: 57-69 - John William Branch, Flavio Prieto, Pierre Boulanger:
A Hole-Filling Algorithm for Triangular Meshes Using Local Radial Basis Function. IMR 2006: 411-431 - Guy Bunin:
Non-Local Topological Clean-Up. IMR 2006: 3-20 - Manuel A. Burgos, Roque Corral, Jaime Fernández-Castañeda, Carlos López:
Rapid Meshing of Turbomachinery Rows Using Semi-Unstructured Conformal Grids. IMR 2006: 93-108 - Guillermo D. Cañas, Steven J. Gortler:
On Asymptotically Optimal Meshes by Coordinate Transformation. IMR 2006: 289-305 - Carlos D. Carbonera, Jason Shepherd:
A Constructive Approach to Constrained Hexahedral Mesh Generation. IMR 2006: 435-452 - Andrey N. Chernikov, Nikos Chrisochoides:
Generalized Delaunay Mesh Refinement: From Scalar to Parallel. IMR 2006: 563-580 - Narcís Coll, Marité Guerrieri, Joan Antoni Sellarès:
Mesh Modification Under Local Domain Changes. IMR 2006: 39-56 - Laurence Giraud-Moreau, Houman Borouchaki, A. Cherouat:
A Remeshing Procedure for Numerical Simulation of Forming Processes in Three Dimensions. IMR 2006: 127-143 - Masayuki Hariya, Ichiro Nishigaki, Ichiro Kataoka, Yoshimitsu Hiro:
Automatic Hexahedral Mesh Generation with Feature Line Extraction. IMR 2006: 453-467 - Benoît Hudson, Gary L. Miller, Todd Phillips:
Sparse Voronoi Refinement. IMR 2006: 339-356 - Yasushi Ito, Alan M. Shih, Roy P. Koomullil, Bharat K. Soni:
A Solution-Based Adaptive Redistribution Method for Unstructured Meshes. IMR 2006: 147-161 - Xiangmin Jiao:
Volume and Feature Preservation in Surface Mesh Optimization. IMR 2006: 359-373 - Xiangmin Jiao, Andrew Colombi, Xinlai Ni, John Hart:
Anisotropic Mesh Adaptation for Evolving Triangulated Surfaces. IMR 2006: 173-190 - Jean-François Lague, Frédéric Hecht:
Optimal Mesh for P1 Interpolation in H1 Seminorm. IMR 2006: 259-270 - Y. K. Lee, Chin K. Lim, Hamid Ghazialam, Harsh Vardhan, Erling Eklund:
Surface Mesh Generation for Dirty Geometries by Shrink Wrapping using Cartesian Grid Approach. IMR 2006: 393-410 - Konstantin Lipnikov, Yuri V. Vassilevski:
Analysis of Hessian Recovery Methods for Generating Adaptive Meshes. IMR 2006: 163-171 - Jianfei Liu, Shuli Sun:
Small Polyhedron Reconnection: A New Way to Eliminate Poorly-Shaped Tetrahedra. IMR 2006: 241-257 - Rafael Montenegro, José Manuel Cascón, José María Escobar, Eduardo Rodríguez, Gustavo Montero:
Implementation in ALBERTA of an Automatic Tetrahedral Mesh Generator. IMR 2006: 325-338 - Nilanjan Mukherjee:
High Quality Bi-Linear Transfinite Meshing with Interior Point Constraints. IMR 2006: 309-323 - Per-Olof Persson, Michael J. Aftosmis, Robert Haimes:
On the Use of Loop Subdivision Surfaces for Surrogate Geometry. IMR 2006: 375-392 - Maria-Cecilia Rivara:
A Study on Delaunay Terminal Edge Method. IMR 2006: 543-562 - Xevi Roca, Josep Sarrate:
An Automatic and General Least-Squares Projection Procedure for Sweep Meshing. IMR 2006: 487-506 - Igor Sazonov, Oubay Hassan, Kenneth Morgan, Nigel P. Weatherill:
Smooth Delaunay-Voronoï Dual Meshes for Co-Volume Integration Schemes. IMR 2006: 529-541 - Hang Si:
On Refinement of Constrained Delaunay Tetrahedralizations. IMR 2006: 509-528 - Bruce Simpson:
How Efficient are Delaunay Refined Meshes? An Empirical Study. IMR 2006: 215-237 - Yannick Sirois, Julien Dompierre, Marie-Gabrielle Vallet, François Guibault:
Mesh Smoothing Based on Riemannian Metric Non-Conformity Minimization. IMR 2006: 271-288 - Matthew L. Staten, Robert Kerr, Steven J. Owen, Ted D. Blacker:
Unconstrained Paving and Plastering: Progress Update. IMR 2006: 469-486 - Ko-Foa Tchon, Ricardo Camarero:
Quad-Dominant Mesh Adaptation Using Specialized Simplicial Optimization. IMR 2006: 21-38
skipping 3 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-18 20:11 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint