scientific article; zbMATH DE number 2145225

From MaRDI portal

Revision as of 17:00, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4657574

Jump to:navigation, search

zbMath1088.68809MaRDI QIDQ4657574

Helmut Alt, Christian Knauer, Günter Rote, S. H. Whitesides

Publication date: 14 March 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Minimal Locked Trees ⋮ Locked and unlocked chains of planar shapes

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4657574&oldid=18861404"