On the public citation graph
On the average length of Delaunay triangulations
0 signed · 34 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.1016/0020-0190(79)90104-2openalex-snapshot
Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation
inferredcites →https://doi.org/10.1016/0020-0190(80)90062-9openalex-snapshot
A note on Delaunay and optimal triangulations
inferredcites →https://doi.org/10.1016/0025-5564(70)90061-1openalex-snapshot
On the homogeneous planar Poisson point process
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
inferredcites →https://doi.org/10.1109/sfcs.1977.21openalex-snapshot
On triangulations of a set of points in the plane
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1214/aoms/1177698870openalex-snapshot
Stochastic Point Processes: Limit Theorems
inferredcites →https://doi.org/10.1214/aoms/1177730210openalex-snapshot
A Lower Bound for the Expected Travel Among $m$ Random Points
inferredcites →https://doi.org/10.1515/crll.1908.134.198openalex-snapshot
Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/pc.27967openalex-snapshot
Analytical model for the electrical conductivity of the hybrid nanocomposite comprising conducting nanowires and insulating particulate fillers
inferred← citeshttps://doi.org/10.1006/jagm.1997.0918openalex-snapshot
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_48openalex-snapshot
Greedy triangulation can be efficiently implemented in the average case
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_163openalex-snapshot
Greedy triangulation approximates the optimum and can be implemented in linear time in the average case
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_21openalex-snapshot
A Parallel Approximation Algorithm for Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_20openalex-snapshot
On the Number of Higher Order Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/bf02187810openalex-snapshot
Toughness and Delaunay triangulations
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/j.tcs.2011.03.005openalex-snapshot
On the number of higher order Delaunay triangulations
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00236-5openalex-snapshot
On exclusion regions for optimal triangulations
inferred← citeshttps://doi.org/10.1016/s0734-189x(86)80059-7openalex-snapshot
Picture processing: 1985
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2799207openalex-snapshot
Euclidean Matchings in Ultra-Dense Networks
inferred← citeshttps://doi.org/10.1109/tmc.2008.94openalex-snapshot
Efficient Broadcasting in Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1137/0608053openalex-snapshot
A New Heuristic for Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1142/s0218195912500112openalex-snapshot
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
inferred← citeshttps://doi.org/10.1145/177424.177649openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1145/41958.41978openalex-snapshot
Toughness and Delaunay triangulations
inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0110403openalex-snapshot
Conceptual Framework for Finding Approximations to Minimum Weight Triangulation and Traveling Salesman Problem of Planar Point Sets
inferred← citeshttps://doi.org/10.17273/book.2006.1openalex-snapshot
Algorithms for triangulation construction and analisys
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1536009/v1openalex-snapshot
Topological characterization for the geometric origin of transition in electrical conductivity for hybrid nanocomposites
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4364openalex-snapshot
On the Number of Higher Order 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.