Pages that link to "Item:Q5851089"
From MaRDI portal
The following pages link to Graph-Theoretic Solutions to Computational Geometry Problems (Q5851089):
Displaying 12 items.
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- Sequential sampling of junction trees for decomposable graphs (Q2080362) (← links)
- Approximating the bundled crossing number (Q2154117) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Counting Blanks in Polygonal Arrangements (Q4585744) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- Approximating the Bundled Crossing Number (Q6075708) (← links)
- Orthogonal dissection into few rectangles (Q6662769) (← links)
