On the public citation graph

Propagation of longest‐edge mesh patterns in local adaptive refinement

0 signed · 24 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nme.767openalex-snapshot
Improving the quality of meshes for the simulation of semiconductor devices using Lepp‐based algorithms
inferredcites →https://doi.org/10.1007/bf01198736openalex-snapshot
Cost analysis of the longest-side (triangle bisection) refinement algorithm for triangulations
inferredcites →https://doi.org/10.1007/bf02241777openalex-snapshot
An adaptive, multi-level method for elliptic boundary value problems
inferredcites →https://doi.org/10.1016/0045-7825(76)90007-4openalex-snapshot
A mesh-refinement scheme for finite element computations
inferredcites →https://doi.org/10.1016/j.cagd.2003.11.001openalex-snapshot
Clifford algebra, Lorentzian geometry, and rational parametrization of canal surfaces
inferredcites →https://doi.org/10.1016/j.cagd.2004.01.001openalex-snapshot
Mesh quality improvement and other properties in the four-triangles longest-edge partition
inferredcites →https://doi.org/10.1016/j.finel.2005.04.002openalex-snapshot
Adaptive mesh refinement for the control of cost and quality in finite element analysis
inferredcites →https://doi.org/10.1016/j.finel.2005.06.005openalex-snapshot
The propagation problem in longest-edge refinement
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0375068-5openalex-snapshot
A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
inferredcites →https://doi.org/10.1090/s0025-5718-96-00772-7openalex-snapshot
The 4-triangles longest-side partition of triangles and linear refinement algorithms
inferredcites →https://doi.org/10.1137/s106482759528065xopenalex-snapshot
Parallel Algorithms for Adaptive Mesh Refinement
inferredcites →https://doi.org/10.2307/2153503openalex-snapshot
PLTMG: A Software Package for Solving Elliptic Partial Differential Equations, Users' Guide 7.0.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cnm.1121openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1002/cnm.1178openalex-snapshot
Erratum
inferred← citeshttps://doi.org/10.1016/j.amc.2010.01.093openalex-snapshot
On the non-degeneracy property of the longest-edge trisection of triangles
inferred← citeshttps://doi.org/10.1016/j.cam.2015.03.046openalex-snapshot
Longest-edge n -section algorithms: Properties and open problems
inferred← citeshttps://doi.org/10.1016/j.cam.2018.06.029openalex-snapshot
Hamiltonian triangular refinements and space-filling curves
inferred← citeshttps://doi.org/10.1016/j.compstruc.2025.107941openalex-snapshot
Mesh deformation and adaptive refinement for physical fields
inferred← citeshttps://doi.org/10.1016/j.matcom.2009.01.009openalex-snapshot
Local refinement based on the 7-triangle longest-edge partition
inferred← citeshttps://doi.org/10.1016/j.matcom.2011.07.003openalex-snapshot
A local refinement algorithm for the longest-edge trisection of triangle meshes
inferred← citeshttps://doi.org/10.1016/j.mcm.2008.02.012openalex-snapshot
Four-triangles adaptive algorithms for RTIN terrain meshes
inferred← citeshttps://doi.org/10.1201/b17713-10openalex-snapshot
- Mesh generation by parallel processing
inferred← citeshttps://doi.org/10.1201/b17713-8openalex-snapshot
- Mesh generation in three dimensions
inferred← citeshttps://doi.org/10.58837/chula.the.2019.140openalex-snapshot
The performance of automatic adaptive edge-based smoothed finite element method in engineering mechanics applications
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.