On the public citation graph
An efficient optimization procedure for tetrahedral meshes by chaos search algorithm
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0207(19960630)39:12<2055::aid-nme942>3.0.co;2-2openalex-snapshot
OPTIMIZATION STRATEGIES IN UNSTRUCTURED MESH GENERATION
inferredcites →https://doi.org/10.1002/(sici)1097-0207(19961030)39:20<3519::aid-nme12>3.0.co;2-oopenalex-snapshot
THREE-DIMENSIONAL FINITE ELEMENT MESHING BY INCREMENTAL NODE INSERTION
inferredcites →https://doi.org/10.1002/(sici)1097-0207(19971115)40:21<3979::aid-nme251>3.0.co;2-9openalex-snapshot
Tetrahedral mesh improvement using swapping and smoothing
inferredcites →https://doi.org/10.1002/1097-0207(20000910/20)49:1/2<109::aid-nme925>3.0.co;2-uopenalex-snapshot
Local optimization-based simplicial mesh untangling and improvement
inferredcites →https://doi.org/10.1002/cnm.1630040603openalex-snapshot
Laplacian smoothing and Delaunay triangulations
inferredcites →https://doi.org/10.1002/nme.1620210805openalex-snapshot
A new mesh generation scheme for arbitrary planar domains
inferredcites →https://doi.org/10.1002/nme.1620310511openalex-snapshot
Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation
inferredcites →https://doi.org/10.1002/nme.1620370905openalex-snapshot
An algorithm for the optimization of directionally stretched triangulations
inferredcites →https://doi.org/10.1007/bf01955874openalex-snapshot
Relationship between tetrahedron shape measures
inferredcites →https://doi.org/10.1016/0045-7949(91)90059-uopenalex-snapshot
Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach
inferredcites →https://doi.org/10.1016/s0045-7825(99)00339-4openalex-snapshot
Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation
inferredcites →https://doi.org/10.1016/s0045-7949(96)00399-9openalex-snapshot
Optimization of tetrahedral meshes based on element shape measures
inferredcites →https://doi.org/10.1080/019697298125678openalex-snapshot
OPTIMIZING COMPLEX FUNCTIONS BY CHAOS SEARCH
inferredcites →https://doi.org/10.1137/0916075openalex-snapshot
Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
inferredcites →https://doi.org/10.1137/s1064827597323208openalex-snapshot
A Parallel Algorithm for Mesh Smoothing
inferredcites →https://doi.org/10.1142/s0218195900000218openalex-snapshot
A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY
inferredcites →https://doi.org/10.2514/3.9393openalex-snapshot
Generation of computational grids using optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.2605openalex-snapshot
Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
inferred← citeshttps://doi.org/10.1007/11914952_15openalex-snapshot
Integrating Trust into Grid Economic Model Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-34958-7_14openalex-snapshot
Small Polyhedron Reconnection: A New Way to Eliminate Poorly-Shaped Tetrahedra
inferred← citeshttps://doi.org/10.1016/j.asoc.2007.05.013openalex-snapshot
Hybrid approach for solving systems of nonlinear equations using chaos optimization and quasi-Newton method
inferred← citeshttps://doi.org/10.1016/j.chaos.2006.04.057openalex-snapshot
On the efficiency of chaos optimization algorithms for global optimization
inferred← citeshttps://doi.org/10.1109/cise.2010.5676713openalex-snapshot
Smoothing Algorithm for Tetrahedral Meshes by Error-Based Quality Metric
inferred← citeshttps://doi.org/10.1155/2013/834908openalex-snapshot
An Efficient Mesh Generation Method for Fractured Network System Based on Dynamic Grid Deformation
inferred← citeshttps://doi.org/10.1155/2015/435648openalex-snapshot
Smoothing Algorithm for Planar and Surface Mesh Based on Element Geometric Deformation
inferred← citeshttps://doi.org/10.1155/2015/908956openalex-snapshot
Toward Collinearity-Avoidable Localization for Wireless Sensor Network
inferred← citeshttps://doi.org/10.4236/iim.2013.56021openalex-snapshot
Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.