Computing a subgraph of the minimum weight triangulation (Q1327172): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0925-7721(94)90014-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988781483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Delaunay and optimal triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Triangulations of Polygonal Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Minimum Weight Triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic triangulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\gamma\)-neighborhood graph / rank
 
Normal rank

Latest revision as of 15:29, 22 May 2024

scientific article
Language Label Description Also known as
English
Computing a subgraph of the minimum weight triangulation
scientific article

    Statements

    Identifiers