Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles

DOI10.1007/11821069_8MaRDI QIDQ5756690zbMATH OpenOpenAlexFDO

Authors Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth

Publication date 5 September 2007

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

Full work available at URL https://doi.org/10.1007/11821069_8

Mathematics Subject Classification ID

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

Recommendations

• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• On pseudo-convex partitions of a planar point set
• Convex polygons are cover-decomposable
• On convex decompositions of a planar point set

Cited in

(4)

• scientific article; zbMATH DE number 3998653 (Why is no real title available?)
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• On pseudo-convex partitions of a planar point set

This page was built for publication: Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles

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