On the public citation graph

On approximation behavior of the greedy triangulation for convex polygons

https://doi.org/10.1007/bf01840358
0 signed · 45 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.1016/0020-0190(78)90066-2openalex-snapshot
The all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0020-0190(79)90021-8openalex-snapshot
A note on the all nearest-neighbor problem 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/s0167-5060(08)70044-xopenalex-snapshot
Minimal Triangulations of Polygonal Domains
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/10515.10523openalex-snapshot
On approximation behavior and implementation of the greedy triangulation for convex planar point sets
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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/0-306-48332-7_360openalex-snapshot
Optimal Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_32openalex-snapshot
Nearly optimal heuristics for binary search trees with geometric generalizations
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-52846-6_93openalex-snapshot
Fast algorithms for greedy triangulation
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/3-540-56287-7_98openalex-snapshot
C-sensitive triangulations approximate the minmax length triangulation
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_220openalex-snapshot
On greedy tetrahedralization of points in 3D
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_64openalex-snapshot
On parallel complexity of planar triangulations
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_59openalex-snapshot
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_6openalex-snapshot
Maximum Weight Triangulation and Its Application on Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_241openalex-snapshot
Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_475openalex-snapshot
Optimal Triangulations
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_22openalex-snapshot
Minimum Weight Triangulations
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_241openalex-snapshot
Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_8openalex-snapshot
Progress on Maximum Weight Triangulation
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-27848-8_241-2openalex-snapshot
Minimum Weight Triangulation
inferred← citeshttps://doi.org/10.1007/bf01188718openalex-snapshot
New results for the minimum weight triangulation problem
inferred← citeshttps://doi.org/10.1007/bf01989747openalex-snapshot
Efficiently updating constrained Delaunay triangulations
inferred← citeshttps://doi.org/10.1007/bf01994882openalex-snapshot
Fast algorithms for greedy triangulation
inferred← citeshttps://doi.org/10.1007/bf02247961openalex-snapshot
Computing the external geodesic diameter of a simple polygon
inferred← citeshttps://doi.org/10.1007/bf02574002openalex-snapshot
Approximating the minimum weight steiner triangulation
inferred← citeshttps://doi.org/10.1007/bfb0021821openalex-snapshot
How to draw outerplanar minimum weight triangulations
inferred← citeshttps://doi.org/10.1007/pl00009216openalex-snapshot
A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons
inferred← citeshttps://doi.org/10.1007/s00453-004-1101-6openalex-snapshot
A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90170-0openalex-snapshot
An ω(√n) lower bound for the nonoptimality of the greedy triangulation
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90122-1openalex-snapshot
A space efficient greedy triangulation algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00012-9openalex-snapshot
Drawing outerplanar minimum weight triangulations
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90134-5openalex-snapshot
Heuristics for optimum binary search trees and minimum weight triangulation problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.001openalex-snapshot
Progress on maximum weight triangulation
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)89149-3openalex-snapshot
Fast greedy triangulation algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00039-xopenalex-snapshot
Checking the convexity of polytopes and the planarity of subdivisions
inferred← citeshttps://doi.org/10.1140/epjb/e2004-00364-9openalex-snapshot
Efficiency and robustness in ant networks of galleries
inferred← citeshttps://doi.org/10.1140/epjb/e2006-00085-1openalex-snapshot
Topological patterns in street networks of self-organized urban settlements
inferred← citeshttps://doi.org/10.1145/177424.177649openalex-snapshot
Fast greedy triangulation algorithms
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.