The drawability problem for minimum weight triangulations (Q5958308): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/LenhartL02, #quickstatements; #temporary_batch_1731547958265
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62042626 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulations intersect nicely / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing proximity trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Angles of Planar Triangular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large subgraph of the minimum weight triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realization problem for Euclidean minimum spanning trees is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a subgraph of the minimum weight triangulation / 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: Drawing outerplanar minimum weight triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time approximation scheme for minimum weight triangulation of convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation / 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: Computing proximity drawings of trees in the 3-dimensional space / 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: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimum weight triangulation of a set of linearly ordered points / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/LenhartL02 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:22, 14 November 2024

scientific article; zbMATH DE number 1715309
Language Label Description Also known as
English
The drawability problem for minimum weight triangulations
scientific article; zbMATH DE number 1715309

    Statements

    The drawability problem for minimum weight triangulations (English)
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    triangulations
    0 references
    computational geometry
    0 references
    graph drawing
    0 references

    Identifiers