Algorithms and Data Structures
From MaRDI portal
Publication:5900769
DOI10.1007/b11837zbMath1278.68305MaRDI QIDQ5900769
Ileana Streinu, Oswin Aichholzer, Bettina Speckmann, Günter Rote
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (8)
Enumerating non-crossing minimally rigid frameworks ⋮ Minimum weight pseudo-triangulations ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ The minimum weight triangulation problem with few inner points ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Enumerating pseudo-triangulations in the plane ⋮ Counting triangulations and other crossing-free structures approximately
This page was built for publication: Algorithms and Data Structures
