On the public citation graph
Approximating the minimum weight steiner triangulation
0 signed · 61 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.1002/cnm.1630040116openalex-snapshot
Some useful data structures for the generation of unstructured grids
inferredcites →https://doi.org/10.1007/3-540-52846-6_93openalex-snapshot
Fast algorithms for greedy triangulation
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.1016/0925-7721(92)90013-iopenalex-snapshot
The farthest point Delaunay triangulation minimizes angles
inferredcites →https://doi.org/10.1016/s0022-0000(05)80059-5openalex-snapshot
Provably good mesh generation
inferredcites →https://doi.org/10.1016/s0167-5060(08)70044-xopenalex-snapshot
Minimal Triangulations of Polygonal Domains
inferredcites →https://doi.org/10.1016/s0925-7721(98)00031-5openalex-snapshot
Geometric applications of posets
inferredcites →https://doi.org/10.1093/comjnl/21.3.243openalex-snapshot
Locally equiangular triangulations
inferredcites →https://doi.org/10.1109/fscs.1990.89526openalex-snapshot
An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio
inferredcites →https://doi.org/10.1109/fscs.1990.89542openalex-snapshot
Provably good mesh generation
inferredcites →https://doi.org/10.1109/mcg.1983.262997openalex-snapshot
A Modified Quadtree Approach To Finite Element Mesh Generation
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.1109/sfcs.1991.185400openalex-snapshot
A quadratic time algorithm for the minmax length triangulation
inferredcites →https://doi.org/10.1137/0910064openalex-snapshot
On Optimal Interpolation Triangle Incidences
inferredcites →https://doi.org/10.1145/355887.355891openalex-snapshot
On a Data Structure for Adaptive Finite Element Mesh Refinements
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/73393.73408openalex-snapshot
Globally-Equiangular triangulations of co-circular points in 0(n log n) time
inferredcites →https://doi.org/10.1145/98524.98535openalex-snapshot
An O(n2log n) time algorithm for the MinMax angle triangulation
inferredcites →https://doi.org/10.5555/127787.127799openalex-snapshot
Approximation algorithms for planar traveling salesman tours and minimum-length triangulations
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.1006/jagm.1998.0984openalex-snapshot
Optimal Point Placement for Mesh Smoothing
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_3openalex-snapshot
Polygon Decomposition for Efficient Construction of Minkowski Sums
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_39openalex-snapshot
Quadtree Decomposition, Steiner Triangulation, and Ray Shooting
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_247openalex-snapshot
Parallel construction of quadtrees and quality 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/978-3-642-33573-0_16openalex-snapshot
Diamond-Kite Meshes: Adaptive Quadrilateral Meshing and Orthogonal Circle Packing
inferred← citeshttps://doi.org/10.1007/pl00009436openalex-snapshot
Approximating Minimum-Weight Triangulations in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00366-013-0327-9openalex-snapshot
Diamond-kite adaptive quadrilateral meshing
inferred← citeshttps://doi.org/10.1007/s00453-009-9329-9openalex-snapshot
Minimum Weight Convex Steiner Partitions
inferred← citeshttps://doi.org/10.1007/s00453-010-9430-0openalex-snapshot
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended
inferred← citeshttps://doi.org/10.1016/j.cma.2019.02.038openalex-snapshot
A polytree based coupling method for non-matching meshes in 3D
inferred← citeshttps://doi.org/10.1016/j.cma.2022.115653openalex-snapshot
An asynchronous parallel explicit solver based on scaled boundary finite element method using octree meshes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.004openalex-snapshot
Steiner reducing sets of minimum weight triangulations: Structure and topology
inferred← citeshttps://doi.org/10.1016/j.compstruc.2023.107175openalex-snapshot
Direct point-cloud-based numerical analysis using octree meshes
inferred← citeshttps://doi.org/10.1016/s0010-4485(03)00064-2openalex-snapshot
A mesh reconstruction algorithm driven by an intrinsic property of a point cloud
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00041-4openalex-snapshot
Polygon decomposition for efficient construction of Minkowski sums
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00078-0openalex-snapshot
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
inferred← citeshttps://doi.org/10.1080/17538947.2018.1543362openalex-snapshot
A procedural footprint enhancement of global topographic surface with multiple levels of detail
inferred← citeshttps://doi.org/10.1080/23729333.2019.1631535openalex-snapshot
Simplification of polylines by segment collapse: minimizing areal displacement while preserving area
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366828openalex-snapshot
Refining a triangulation of a planar straight-line graph to eliminate large angles
inferred← citeshttps://doi.org/10.1109/tvcg.2020.2976922openalex-snapshot
A Review of Methods to Compute Minkowski Operations for Geometric Overlap Detection
inferred← citeshttps://doi.org/10.1137/1.9781611975031.7openalex-snapshot
A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem
inferred← citeshttps://doi.org/10.1142/s0218195901000651openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 42
inferred← citeshttps://doi.org/10.1142/s0218195999000303openalex-snapshot
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
inferred← citeshttps://doi.org/10.1145/1132516.1132563openalex-snapshot
A quasi-polynomial time approximation scheme for minimum weight triangulation
inferred← citeshttps://doi.org/10.1145/1346330.1346336openalex-snapshot
Minimum-weight triangulation is NP-hard
inferred← citeshttps://doi.org/10.1145/1516512.1516517openalex-snapshot
A quasi-polynomial time approximation scheme for minimum weight triangulation
inferred← citeshttps://doi.org/10.1145/262839.262972openalex-snapshot
Average-case ray shooting and minimum weight triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0108021openalex-snapshot
Computational Geometry Column 42
inferred← citeshttps://doi.org/10.53808/kus.2022.icstem4ir.0039-seopenalex-snapshot
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
inferred← citeshttps://doi.org/10.5555/314161.314383openalex-snapshot
Optimal point placement for mesh smoothing
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.