On the public citation graph
Construction of K -Dimensional Delaunay Triangulations Using Local Transformations
0 signed · 38 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/nme.1620210210openalex-snapshot
An apporach to automatic three‐dimensional finite element mesh generation
inferredcites →https://doi.org/10.1002/nme.1620290105openalex-snapshot
A combined octree/delaunay method for fully automatic 3‐D mesh generation
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.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02579380openalex-snapshot
On triangulations of the convex hull ofn points
inferredcites →https://doi.org/10.1016/0141-1195(87)90043-xopenalex-snapshot
A fast algorithm for constructing Delaunay triangulations in the plane
inferredcites →https://doi.org/10.1016/0167-8396(86)90001-4openalex-snapshot
Properties of n-dimensional triangulations
inferredcites →https://doi.org/10.1016/0167-8396(91)90038-dopenalex-snapshot
Construction of three-dimensional Delaunay triangulations using local transformations
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
inferredcites →https://doi.org/10.1093/comjnl/24.2.162openalex-snapshot
Computing Dirichlet tessellations
inferredcites →https://doi.org/10.1093/comjnl/24.2.167openalex-snapshot
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
inferredcites →https://doi.org/10.1137/0907035openalex-snapshot
Delaunay Triangular Meshes in Convex Polygons
inferredcites →https://doi.org/10.1137/0910044openalex-snapshot
Three-Dimensional Triangulations from Local Transformations
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.2307/3214289openalex-snapshot
On the convex hull of random points in a polytope
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-31125-3_14openalex-snapshot
A Review on Delaunay Refinement Techniques
inferred← citeshttps://doi.org/10.1016/s0168-874x(96)00037-6openalex-snapshot
A posteriori error estimation and three-dimensional automatic mesh generation
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00164-3openalex-snapshot
The computation of simplicial approximations of implicitly defined p-dimensional manifolds
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)31850-5openalex-snapshot
Multi-Parametric Nonlinear Programming and the Evaluation of Implicit Optimization Model Adequacy
inferred← citeshttps://doi.org/10.1103/physreve.57.3767openalex-snapshot
Superparamagnetic clustering of data
inferred← citeshttps://doi.org/10.1103/physrevlett.76.3251openalex-snapshot
Superparamagnetic Clustering of Data
inferred← citeshttps://doi.org/10.1108/eum0000000006495openalex-snapshot
2D and 3D finite element meshing and remeshing
inferred← citeshttps://doi.org/10.1109/20.877739openalex-snapshot
Boundary refinement in n-dimensional Delaunay-meshing
inferred← citeshttps://doi.org/10.1109/robot.1998.677092openalex-snapshot
A general theory for positioning and orienting 2D polygonal or curved parts using intelligent motion surfaces
inferred← citeshttps://doi.org/10.1145/777792.777821openalex-snapshot
Updating and constructing constrained delaunay and constrained regular triangulations by flips
inferred← citeshttps://doi.org/10.1177/0731684405050404openalex-snapshot
New Remeshing Applications in Resin Transfer Molding
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.5075/epfl-thesis-2432openalex-snapshot
Dynamic triangulations for efficient 3D simulation of granular materials
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3378openalex-snapshot
On the behavior of spherical and non-spherical grain assemblies, its modeling and numerical simulation
inferred← citeshttps://doi.org/10.54419/6fb987openalex-snapshot
3D Topography. A Simplicial Complex-based Solution in a Spatial DBMS
inferred← citeshttps://doi.org/10.6100/ir569709openalex-snapshot
A platform for numerical computations with special application to preconditioning
inferred← citeshttps://doi.org/10.68381/jca29008openalex-snapshot
The Lifting Projection of Convex Polyhedra for Finding Delaunay Triangulations
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.