On the public citation graph
New results for the minimum weight triangulation problem
0 signed · 43 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/3-540-12689-9_110openalex-snapshot
The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete
inferredcites →https://doi.org/10.1007/3-540-52846-6_93openalex-snapshot
Fast algorithms for greedy triangulation
inferredcites →https://doi.org/10.1007/978-1-4842-9459-8_2openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1007/bf01188718openalex-snapshot
New results for the minimum weight triangulation problem
inferredcites →https://doi.org/10.1007/bf01840358openalex-snapshot
On approximation behavior of the greedy triangulation for convex polygons
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/0020-0190(87)90170-0openalex-snapshot
An ω(√n) lower bound for the nonoptimality of the greedy triangulation
inferredcites →https://doi.org/10.1016/0196-6774(87)90020-4openalex-snapshot
A heuristic triangulation algorithm
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.1137/0608053openalex-snapshot
A New Heuristic for Minimum Weight Triangulation
inferredcites →https://doi.org/10.2307/2345191openalex-snapshot
Display and Analysis of Spatial Data.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-58325-4_207openalex-snapshot
A chain decomposition algorithm for the proof of a property on minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_140openalex-snapshot
A fast heuristic for approximating the minimum weight triangulation
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_22openalex-snapshot
Minimum Weight Triangulations
inferred← citeshttps://doi.org/10.1007/bf02007174openalex-snapshot
Improved heuristics for the minimum weight triangulation problem
inferred← citeshttps://doi.org/10.1007/bfb0009503openalex-snapshot
A new subgraph of minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/bfb0021821openalex-snapshot
How to draw outerplanar minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/s003710100125openalex-snapshot
Multicriteria-optimized triangulations
inferred← citeshttps://doi.org/10.1007/s10878-008-9158-9openalex-snapshot
An almost four-approximation algorithm for maximum weight triangulation
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00200-6openalex-snapshot
Tight lower bounds for minimum weight triangulation heuristics
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00012-9openalex-snapshot
Drawing outerplanar minimum weight 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/s0304-3975(00)00318-2openalex-snapshot
On β-skeleton as a subgraph of the minimum weight triangulation
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00008-6openalex-snapshot
A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1023/a:1009796113861openalex-snapshot
A New Subgraph of Minimum Weight Triangulations
inferred← citeshttps://doi.org/10.1109/tgrs.2024.3493596openalex-snapshot
An Adaptive, Statistical Multiscale Phase Unwrapping Approach to Process Large Swath Interferograms
inferred← citeshttps://doi.org/10.1142/s0218195908002581openalex-snapshot
FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
inferred← citeshttps://doi.org/10.1145/177424.177649openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1145/220279.220305openalex-snapshot
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
inferred← citeshttps://doi.org/10.1145/237218.237360openalex-snapshot
Approaching the largest β-skeleton within a minimum weight triangulation
inferred← citeshttps://doi.org/10.1145/330560.330833openalex-snapshot
A weight-coded genetic algorithm for the minimum weight triangulation problem
inferred← citeshttps://doi.org/10.21533/scjournalopenalex-snapshot
Southeast Europe Journal of Soft Computing
inferred← citeshttps://doi.org/10.21533/scjournal.v3i2.3openalex-snapshot
Finding optimal triangulation based on block method
showing the first 28 of 29 · page through all 29
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.