Convex Partitions with 2-Edge Connected Dual Graphs

DOI10.1007/978-3-642-02882-3_20MaRDI QIDQ5323063zbMATH OpenOpenAlexFDO

Authors

Publication date 23 July 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_20

Mathematics Subject Classification ID

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

Recommendations

• Convex partitions with 2-edge connected dual graphs
• Graph Drawing
• Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs
• On convex partitions of polygonal regions
• scientific article; zbMATH DE number 1522947

Cites work

• Approximate convex decomposition of polygons
• Compatible geometric matchings
• Every set of disjoint line segments admits a binary tree
• Finding equitable convex partitions of points in a polygon efficiently
• Global Geometry of Polygons. I: The Theorem of Fabricius-Bjerre
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 3767037 (Why is no real title available?)
• scientific article; zbMATH DE number 1424299 (Why is no real title available?)
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Perfect partitions of convex sets in the plane
• Tight bounds for connecting sites across barriers

Cited in

(1)

• Convex partitions with 2-edge connected dual graphs

This page was built for publication: Convex Partitions with 2-Edge Connected Dual Graphs

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