The following pages link to (Q4945512):
Displaying 36 items.
- On \(k\)-convex polygons (Q427049) (← links)
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- The structure of optimal partitions of orthogonal polygons into fat rectangles (Q598555) (← links)
- Convex partitions with 2-edge connected dual graphs (Q652620) (← links)
- Approximate convex decomposition of polyhedra and its applications (Q735498) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- Lower bounds for approximate polygon decomposition and minimum gap (Q1603513) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Morphological decomposition and compression of binary images via a minimum set cover algorithm (Q1716775) (← links)
- A combinatorial property on angular orders of plane point sets (Q1944953) (← links)
- Compressed algebraic cubature over polygons with applications to optical design (Q2297095) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Note on covering monotone orthogonal polygons with star-shaped polygons (Q2380027) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Weighted skeletons and fixed-share decomposition (Q2483555) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- 3D Rectangulations and Geometric Matrix Multiplication (Q2942614) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application (Q3192956) (← links)
- Counting Blanks in Polygonal Arrangements (Q4585744) (← links)
- (Q4670520) (← links)
- (Q4945679) (← links)
- Close-to-optimal algorithm for rectangular decomposition of 3D shapes (Q5218999) (← links)
- Convex Partitions with 2-Edge Connected Dual Graphs (Q5323063) (← links)
- CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES (Q5358087) (← links)
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem (Q5452162) (← links)
- Cutting polygons into small pieces with chords: Laser-based localization (Q5874470) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)
- Keep your distance: land division with separation (Q6114476) (← links)
- On geometric shape construction via growth operations (Q6140359) (← links)
- Shape decomposition algorithms for laser capture microdissection (Q6487647) (← links)
- Uniformly monotone partitioning of polygons (Q6593668) (← links)
