On the public citation graph
Delaunay triangulation and the convex hull ofn points in expected linear time
0 signed · 74 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.1007/bf00977785openalex-snapshot
Two algorithms for constructing a Delaunay triangulation
inferredcites →https://doi.org/10.1007/bf01944471openalex-snapshot
A constant-time parallel algorithm for computing convex hulls
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1093/comjnl/21.2.168openalex-snapshot
Computing Dirichlet Tessellations in the Plane
inferredcites →https://doi.org/10.1093/comjnl/21.3.243openalex-snapshot
Locally equiangular triangulations
inferredcites →https://doi.org/10.1111/j.1538-4632.1979.tb00695.xopenalex-snapshot
A Procedure to Generate Thiessen Polygons
inferredcites →https://doi.org/10.1111/j.2517-6161.1977.tb01615.xopenalex-snapshot
Modelling Spatial Patterns
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/355759.355766openalex-snapshot
A New Convex Hull Algorithm for Planar Sets
inferredcites →https://doi.org/10.1179/caj.1980.17.2.93openalex-snapshot
Delaunay Triangulation of a Random Data Set for Isarithmic Mapping
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcc.23538openalex-snapshot
Voronota: A fast and reliable tool for computing the vertices of the Voronoi diagram of atomic balls
inferred← citeshttps://doi.org/10.1007/978-3-642-41905-8_4openalex-snapshot
Localizing the Delaunay Triangulation and Its Parallel Implementation
inferred← citeshttps://doi.org/10.1007/978-3-642-55787-3_6openalex-snapshot
Terrain Modeling Using Voronoi Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-7091-6783-0_7openalex-snapshot
Hierarchical Data Representations Based on Planar Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/978-981-15-2043-3_65openalex-snapshot
A Subspace Similarity-Based Data Clustering by Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/bf01759042openalex-snapshot
AnO(n logn) plane-sweep algorithm forL 1 andL ∞ Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01840356openalex-snapshot
A faster divide-and-conquer algorithm for constructing delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf02017351openalex-snapshot
An efficient and numerically correct algorithm for the 2D convex hull problem
inferred← citeshttps://doi.org/10.1007/bf02241271openalex-snapshot
Automatic mesh generation for finite element analysis
inferred← citeshttps://doi.org/10.1007/bf02574694openalex-snapshot
Higher-dimensional voronoi diagrams in linear expected time
inferred← citeshttps://doi.org/10.1007/pl00009234openalex-snapshot
A Note on Point Location in Delaunay Triangulations of Random Points
inferred← citeshttps://doi.org/10.1007/s12541-011-0056-1openalex-snapshot
A divide-and-conquer Delaunay triangulation algorithm with a vertex array and flip operations in two-dimensional space
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90225-0openalex-snapshot
A linear expected-time algorithm for computing planar relative neighbourhood graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90095-fopenalex-snapshot
A straightforward iterative algorithm for the planar Voronoi diagram
inferred← citeshttps://doi.org/10.1016/0031-3203(86)90012-9openalex-snapshot
Computing relative neighbourhood graphs in the plane
inferred← citeshttps://doi.org/10.1016/0045-7825(95)00854-1openalex-snapshot
Fast Delaunay triangulation in three dimensions
inferred← citeshttps://doi.org/10.1016/0098-3004(91)90050-nopenalex-snapshot
An ANSI C program to determine in expected linear time the vertices of the convex hull of a set of planar points
inferred← citeshttps://doi.org/10.1016/0098-3004(93)90062-aopenalex-snapshot
Fast topological construction of delaunay triangulations and voronoi diagrams
inferred← citeshttps://doi.org/10.1016/0098-3004(94)00087-bopenalex-snapshot
Assessing geometric algorithms: Some comments arising from the paper “Fast topological construction of Delaunay triangulations and Voronoi diagrams” by Victor J. D. Tsai
inferred← citeshttps://doi.org/10.1016/0167-8191(87)90045-7openalex-snapshot
Comments on two parallel algorithms for the planar convex hull problem
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90096-9openalex-snapshot
Picture processing: 1984
inferred← citeshttps://doi.org/10.1016/b978-012553010-1/50008-6openalex-snapshot
Mesh generation and adaptivity for complex geometries and flows
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2011.09.003openalex-snapshot
A faster circle-sweep Delaunay triangulation algorithm
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2022.103129openalex-snapshot
An incremental algorithm for simultaneous construction of 2D Voronoi diagram and Delaunay triangulation based on a face-based data structure
inferred← citeshttps://doi.org/10.1016/j.cad.2025.103933openalex-snapshot
Parallel 3D Delaunay Triangulation on the GPU
inferred← citeshttps://doi.org/10.1016/j.cherd.2023.08.016openalex-snapshot
A model-based approach towards accelerated process development: A case study on chromatography
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.011openalex-snapshot
Communication-Free Massively Distributed Graph Generation
inferred← citeshttps://doi.org/10.1016/s0010-4485(97)00082-1openalex-snapshot
DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00017-1openalex-snapshot
A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00025-9openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1023/a:1009934225596openalex-snapshot
Exact Computation of Delaunay and Power Triangulations
inferred← citeshttps://doi.org/10.1080/02693799308901979openalex-snapshot
Delaunay triangulations in TIN creation: an overview and a linear-time algorithm
inferred← citeshttps://doi.org/10.1103/physreve.80.041101openalex-snapshot
Percolation thresholds on two-dimensional Voronoi networks and Delaunay triangulations
inferred← citeshttps://doi.org/10.1108/eb010019openalex-snapshot
DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/43.248082openalex-snapshot
Mixed element trees: a generalization of modified octrees for the generation of meshes for the simulation of complex 3-D semiconductor device structures
inferred← citeshttps://doi.org/10.1109/5.163414openalex-snapshot
Relative neighborhood graphs and their relatives
inferred← citeshttps://doi.org/10.1109/access.2019.2926139openalex-snapshot
Computational Cosmetic Quality Assessment of Human Hair in Low Magnifications
inferred← citeshttps://doi.org/10.1109/isie.2011.72openalex-snapshot
An Optimum Convex Decomposition Algorithm of Simple Polygon Based on Its Adjacent Concave Vertex Connection
inferred← citeshttps://doi.org/10.1109/isvd.2012.9openalex-snapshot
Localizing the Delaunay Triangulation and its Parallel Implementation
inferred← citeshttps://doi.org/10.1109/lra.2023.3297062openalex-snapshot
Concave-Hull Induced Graph-Gain for Fast and Robust Robotic Exploration
inferred← citeshttps://doi.org/10.1111/1467-8659.1230129openalex-snapshot
Parallel 3D Delaunay Triangulation
inferred← citeshttps://doi.org/10.1119/5.0087591openalex-snapshot
Voronoi cell analysis: The shapes of particle systems
inferred← citeshttps://doi.org/10.1142/s1793830923500143openalex-snapshot
OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations
inferred← citeshttps://doi.org/10.1145/10515.10545openalex-snapshot
A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/220279.220286openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1145/73833.73869openalex-snapshot
Higher-dimensional Voronoi diagrams in linear expected time
inferred← citeshttps://doi.org/10.1349/ddlp.1799openalex-snapshot
Efficient parallel algorithms for closest point problems.
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
inferred← citeshttps://doi.org/10.3390/rs15205060openalex-snapshot
Volume Estimation of Stem Segments Based on a Tetrahedron Model Using Terrestrial Laser Scanning Data
inferred← citeshttps://doi.org/10.3970/cmes.2014.100.031openalex-snapshot
A systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.181-182.661openalex-snapshot
A Real-Time Algorithm for Convex Hull Construction and Delaunay Triangulation of Scattered Points Data
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.