Convex partitions with 2-edge connected dual graphs

DOI10.1007/s10878-010-9310-1zbMath1229.90150OpenAlexW1968583908MaRDI QIDQ652620

Juan-Miguel Gracia

Publication date: 15 December 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9310-1

zbMATH Keywords

dual graphsconvex partitionsgeometric matchings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

A tight bound for point guards in piecewise convex art galleries ⋮ Disjoint compatible geometric matchings ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs

Cites Work

• Compatible geometric matchings
• Tight bounds for connecting sites across barriers
• Perfect partitions of convex sets in the plane
• Guarding disjoint triangles and claws in the plane
• Approximate convex decomposition of polygons
• Algorithms for Reporting and Counting Geometric Intersections
• Global Geometry of Polygons. I: The Theorem of Fabricius-Bjerre
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
• Shooting permanent rays among disjoint polygons in the plane
• A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
• Approximation Algorithms for the Minimum Convex Partition Problem
• Acute triangulations of 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