Pages that link to "Item:Q4066653"
From MaRDI portal
The following pages link to Determining the minimum-area encasing rectangle for an arbitrary closed curve (Q4066653):
Displayed 23 items.
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- A new algorithm for the minimal-area convex enclosure problem (Q1127205) (← links)
- Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- Packing problems (Q1197916) (← links)
- A note on the all nearest-neighbor problem for convex polygons (Q1254857) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- Minimum area circumscribing polygons (Q1822239) (← links)
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) (Q1894936) (← links)
- Reconfigurable meshes and image processing (Q1898157) (← links)
- Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
- Boundary based shape orientation (Q2476587) (← links)
- Two-dimensional profile-packing approach for multi-torch flame cutting (Q3605412) (← links)
- Finding minimal enclosing boxes (Q3704926) (← links)
- Convex hull of a planar set of straight and circular line segments (Q4484714) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ (Q4819959) (← links)