On the public citation graph

Parallel divide-and-conquer scheme for 2D Delaunay triangulation

0 signed · 39 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.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf01840356openalex-snapshot
A faster divide-and-conquer algorithm for constructing delaunay triangulations
inferredcites →https://doi.org/10.1007/bfb0014474openalex-snapshot
Applied Computational Geometry Towards Geometric Engineering
inferredcites →https://doi.org/10.1007/bfb0014497openalex-snapshot
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator
inferredcites →https://doi.org/10.1007/pl00008262openalex-snapshot
Design and Implementation of a Practical Parallel Delaunay Algorithm
inferredcites →https://doi.org/10.1016/s0010-4485(97)00082-1openalex-snapshot
DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed
inferredcites →https://doi.org/10.1016/s0045-7825(98)00374-0openalex-snapshot
Distributed parallel Delaunay mesh generation
inferredcites →https://doi.org/10.1016/s0925-7721(96)00025-9openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferredcites →https://doi.org/10.1109/ipdps.2001.924969openalex-snapshot
Parallel 2D Delaunay triangulations in HPP and MPI
inferredcites →https://doi.org/10.1109/ipdps.2003openalex-snapshot
Proceedings International Parallel and Distributed Processing Symposium
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/366622.366644openalex-snapshot
Algorithm 64: Quicksort
inferredcites →https://doi.org/10.1145/366622.366647openalex-snapshot
Algorithm 65: find
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.4157openalex-snapshot
Adaptive parallel Delaunay triangulation construction with dynamic pruned binary tree model in Cloud
inferred← citeshttps://doi.org/10.1002/wics.1298openalex-snapshot
Tessellation
inferred← citeshttps://doi.org/10.1007/s10586-022-03699-9openalex-snapshot
Enhanced unstructured points cloud subdivision applied for parallel Delaunay triangulation
inferred← citeshttps://doi.org/10.1007/s11075-011-9493-2openalex-snapshot
A parallel algorithm based on convexity for the computing of Delaunay tessellation
inferred← citeshttps://doi.org/10.1007/s12145-012-0106-yopenalex-snapshot
Grid interpolation algorithm based on nearest neighbor fast search
inferred← citeshttps://doi.org/10.1016/j.cageo.2011.01.008openalex-snapshot
ParaStream: A parallel streaming Delaunay triangulation algorithm for LiDAR points on multicore architectures
inferred← citeshttps://doi.org/10.1016/j.cma.2012.05.009openalex-snapshot
Parallel Delaunay triangulation in three dimensions
inferred← citeshttps://doi.org/10.1016/j.cmpb.2024.108108openalex-snapshot
Facial augmented reality based on hierarchical optimization of similarity aspect graph
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.008openalex-snapshot
Parallel geometric algorithms for multi-core computers
inferred← citeshttps://doi.org/10.1016/j.finel.2012.07.003openalex-snapshot
Parallel Delaunay triangulation—Application to two dimensions
inferred← citeshttps://doi.org/10.1016/j.finel.2015.05.003openalex-snapshot
3D Delaunay triangulation of 1 billion points on a PC
inferred← citeshttps://doi.org/10.1016/j.istruc.2021.02.022openalex-snapshot
An improved adaptive web sampling method for node deviation inspection of single-layer latticed shells
inferred← citeshttps://doi.org/10.1021/acs.langmuir.8b03044openalex-snapshot
Nanoscale Study of Bubble Nucleation on a Cavity Substrate Using Molecular Dynamics Simulation
inferred← citeshttps://doi.org/10.1080/13658816.2017.1300804openalex-snapshot
Parallel constrained Delaunay triangulation on the GPU
inferred← citeshttps://doi.org/10.1080/15481603.2014.946666openalex-snapshot
Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006534openalex-snapshot
Tile & Merge: Distributed Delaunay Triangulations for Cloud Computing
inferred← citeshttps://doi.org/10.1109/iiswc.2007.4362186openalex-snapshot
Delaunay Triangulation with Transactions and Barriers
inferred← citeshttps://doi.org/10.1109/ispa.2010.71openalex-snapshot
The Merge Phase of Parallel Divide-and-Conquer Scheme for 3D Delaunay Triangulation
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.3390/infrastructures2010001openalex-snapshot
Comparative Analysis of Triangulation Libraries for Modeling Large Point Clouds from Land and Their Infrastructures
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.548-549.1143openalex-snapshot
The Use of OpenMP Parallel Standards in Massive Data Delaunay Triangulation
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.819.299openalex-snapshot
An Improved Parallel Computation Method for Delaunay Triangulation
inferred← citeshttps://doi.org/10.48550/arxiv.2003.11914openalex-snapshot
Geometric Sparsification of Closeness Relations: Eigenvalue Clustering for Computing Matrix Functions
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.