On the public citation graph

Cost analysis of the longest-side (triangle bisection) refinement algorithm for triangulations

0 signed · 40 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/cnm.1630080502openalex-snapshot
A 3‐D refinement algorithm suitable for adaptive and multi‐grid techniques
inferredcites →https://doi.org/10.1002/nme.1620200412openalex-snapshot
Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
inferredcites →https://doi.org/10.1002/nme.1620240710openalex-snapshot
A grid generator based on 4‐triangles conforming mesh‐refinement algorithms
inferredcites →https://doi.org/10.1002/nme.1620281212openalex-snapshot
Selective refinement/derefinement algorithms for sequences of nested triangulations
inferredcites →https://doi.org/10.1002/nme.1620330205openalex-snapshot
Mesh generation/refinement using fractal concepts and iterated function systems
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01900751openalex-snapshot
Adaptive polygonization of parametric surfaces
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.1145/1271.1274openalex-snapshot
Design and data structure of fully adaptive, multigrid, finite-element software
inferredcites →https://doi.org/10.1145/142675.142722openalex-snapshot
Triangulating polygons without large angles

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0207(19970930)40:18<3313::aid-nme214>3.0.co;2-#openalex-snapshot
New longest‐edge algorithms for the refinement and/or improvement of unstructured triangulations
inferred← citeshttps://doi.org/10.1002/cnm.956openalex-snapshot
Propagation of longest‐edge mesh patterns in local adaptive refinement
inferred← citeshttps://doi.org/10.1002/fld.988openalex-snapshot
Dendritic solidification of binary alloys with free and forced convection
inferred← citeshttps://doi.org/10.1002/num.21838openalex-snapshot
A posteriori error estimates of edge residual type of finite element method for nonmonotone quasi‐linear elliptic problems
inferred← citeshttps://doi.org/10.1007/978-0-8176-8184-5_32openalex-snapshot
Terminal-Edge Algorithms: an Integrated Approach for Mesh Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-03413-8_14openalex-snapshot
Optimal multilevel methods for H(grad), H(curl), and H(div) systems on graded and unstructured grids
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_14openalex-snapshot
A Review on Delaunay Refinement Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_16openalex-snapshot
An Overview of Procedures for Refining Triangulations
inferred← citeshttps://doi.org/10.1007/s11425-008-0113-0openalex-snapshot
Residual-based a posteriori error estimates of nonconforming finite element method for elliptic problems with Dirac delta source terms
inferred← citeshttps://doi.org/10.1007/s11709-015-0317-7openalex-snapshot
Adaptive selective ES-FEM limit analysis of cracked plane-strain structures
inferred← citeshttps://doi.org/10.1016/j.amc.2005.12.030openalex-snapshot
Towards a more efficient dynamic mesh adaptation methodology for continuum discretization in complex engineering problems
inferred← citeshttps://doi.org/10.1016/j.apnum.2004.06.010openalex-snapshot
Adaptive techniques for unstructured nested meshes
inferred← citeshttps://doi.org/10.1016/j.apnum.2008.12.011openalex-snapshot
Lepp-bisection algorithms, applications and mathematical properties
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.euromechsol.2016.02.005openalex-snapshot
An adaptive selective ES-FEM for plastic collapse analysis
inferred← citeshttps://doi.org/10.1016/j.finel.2005.06.005openalex-snapshot
The propagation problem in longest-edge refinement
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/s0010-4485(00)00125-1openalex-snapshot
Terminal-edges Delaunay (small-angle based) algorithm for the quality triangulation problem
inferred← citeshttps://doi.org/10.1016/s0021-9991(03)00185-2openalex-snapshot
Modeling dendritic growth of a binary alloy
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00484-8openalex-snapshot
On the adjacencies of triangular meshes based on skeleton-regular partitions
inferred← citeshttps://doi.org/10.1063/1.3241527openalex-snapshot
Unstructured Adaptive Mesh Refinement and Coarsening for Fluid Flow at All Speeds Using a Coupled Solver
inferred← citeshttps://doi.org/10.1088/0264-9381/23/1/013openalex-snapshot
A toy model for testing finite element methods to simulate extreme-mass-ratio binary systems
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00772-7openalex-snapshot
The 4-triangles longest-side partition of triangles and linear refinement algorithms
inferred← citeshttps://doi.org/10.1108/eum0000000005788openalex-snapshot
Error estimates and adaptive finite element methods
inferred← citeshttps://doi.org/10.1108/eum0000000006495openalex-snapshot
2D and 3D finite element meshing and remeshing
inferred← citeshttps://doi.org/10.1109/icppw.2006.72openalex-snapshot
Tetrahedral Mesh Refinement in Distributed Environments
inferred← citeshttps://doi.org/10.1109/lawp.2024.3524566openalex-snapshot
A Nonconformal Adaptive $h$-Refinement Method for 2-D Finite Element Analysis Based on Normalized Edge Basis Functions
inferred← citeshttps://doi.org/10.1142/s0218202503002878openalex-snapshot
A Posteriori Error Estimates for the Finite Element Approximation of Eigenvalue Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1611.08266openalex-snapshot
Researches on Dynamic Load Balancing Algorithms and hp-Adaptivity in 3-D Parallel Adaptive Finite Element Computations
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.