On the public citation graph

Algorithm for constrained delaunay triangulation

https://doi.org/10.1007/bf01901582

0 signed · 23 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.1007/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot

Algorithms in Combinatorial Geometry

inferredcites →https://doi.org/10.1007/bf02187695openalex-snapshot

Generalized delaunay triangulation for planar graphs

inferredcites →https://doi.org/10.1016/0734-189x(85)90005-2openalex-snapshot

Delaunay-based representation of surfaces defined over arbitrarily shaped domains

inferredcites →https://doi.org/10.1016/s0734-189x(88)80028-8openalex-snapshot

Shape reconstruction from planar cross sections

inferredcites →https://doi.org/10.1109/38.210490openalex-snapshot

Delaunay triangulation using a uniform grid

inferredcites →https://doi.org/10.1137/0727074openalex-snapshot

A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers

inferredcites →https://doi.org/10.1145/41958.41981openalex-snapshot

Constrained Delaunay triangulations

inferredcites →https://doi.org/10.1524/zkri.1933.84.1.109openalex-snapshot

Neue Darstellung der geometrischen Kristallographie

inferredcites →https://doi.org/10.2307/2325168openalex-snapshot

Algorithms in Combinatorial Geometry.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-60697-1_113openalex-snapshot

Advancing front meshing for radiosity solutions

inferred← citeshttps://doi.org/10.1016/j.cad.2004.06.011openalex-snapshot

Non-self-overlapping Hermite interpolation mapping: a practical solution for structured quadrilateral meshing

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.006openalex-snapshot

Detecting tetrahedralizations of a set of line segments

inferred← citeshttps://doi.org/10.1016/s0097-8493(97)00080-0openalex-snapshot

Multiresolution representations for surfaces meshes based on the vertex decimation method

inferred← citeshttps://doi.org/10.1080/13658810110074492openalex-snapshot

Comparison of existing triangulation methods for regularly and irregularly spaced height fields

inferred← citeshttps://doi.org/10.1109/36.950801openalex-snapshot

Error statistics for slope and aspect when derived from interpolated data

inferred← citeshttps://doi.org/10.1109/cise.2009.5366643openalex-snapshot

The Research and Implementation of Interactive Terrain Editing and Crack Elimination

inferred← citeshttps://doi.org/10.1109/ifita.2010.149openalex-snapshot

A 3D Simulation System of Seabed Terrain Based on LOD Technology

inferred← citeshttps://doi.org/10.1145/218013.218095openalex-snapshot

Bubble mesh

inferred← citeshttps://doi.org/10.32657/10356/14962openalex-snapshot

Real-time procedural modeling of fracture of brittle materials in games

inferred← citeshttps://doi.org/10.3390/ijgi9060410openalex-snapshot

An Evaluation Model of Level of Detail Consistency of Geographical Features on Digital Maps

inferred← citeshttps://doi.org/10.3724/sp.j.1087.2008.00469openalex-snapshot

Fast algorithm for surface reconstruction from cloud data based RBF neural network

inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.90-93.3277openalex-snapshot

A Constrained Delaunay Triangulation Algorithm Based on Incremental Points

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.