Algorithms and Data Structures

DOI10.1007/B11837MaRDI QIDQ5900769zbMATH OpenFDO

Authors Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Zigzags
• On a geometric problem of zigzags.
• Algorithms and Data Structures
• scientific article; zbMATH DE number 1161355
• On maps with a single zigzag.
• scientific article; zbMATH DE number 4174391
• The crossing function and its application to zig-zag tool paths.

Cited in

(11)

• Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
• Enumerating non-crossing minimally rigid frameworks
• On a geometric problem of zigzags.
• Algorithms and Data Structures
• Planar minimally rigid graphs and pseudo-triangulations
• Minimum weight pseudo-triangulations
• Enumerating pseudo-triangulations in the plane
• The minimum weight triangulation problem with few inner points
• The stochastic walk algorithms for point location in pseudo-triangulations
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• Counting triangulations and other crossing-free structures approximately

This page was built for publication: Algorithms and Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900769)