Pages that link to "Item:Q808703"
From MaRDI portal
The following pages link to Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703):
Displaying 6 items.
- Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension (Q1003705) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)
