Convex Partitions with 2-Edge Connected Dual Graphs
From MaRDI portal
Publication:5323063
DOI10.1007/978-3-642-02882-3_20zbMath1248.68517OpenAlexW1536215131MaRDI QIDQ5323063
No author found.
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
Cites Work
- Compatible geometric matchings
- Tight bounds for connecting sites across barriers
- Perfect partitions of convex sets in the plane
- Approximate convex decomposition of polygons
- Global Geometry of Polygons. I: The Theorem of Fabricius-Bjerre
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Every set of disjoint line segments admits a binary tree
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convex Partitions with 2-Edge Connected Dual Graphs