Pages that link to "Item:Q3697817"
From MaRDI portal
The following pages link to Finding the smallest triangles containing a given convex polygon (Q3697817):
Displaying 32 items.
- Minimum-area enclosing triangle with a fixed angle (Q390370) (← links)
- \(\mathcal{C}^1\) cubic splines on Powell-Sabin triangulations (Q668345) (← links)
- Computing shortest transversals (Q757096) (← links)
- Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes (Q990126) (← links)
- A polynomial solution for the Potato-peeling problem (Q1076347) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Minimum vertex hulls for polyhedral domains (Q1199529) (← links)
- Optimal placement of convex polygons to maximize point containment (Q1265324) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- A B-spline basis for \(C^1\) quadratic splines on triangulations with a 10-split (Q1643862) (← links)
- Construction and analysis of cubic Powell-Sabin B-splines (Q1686337) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- The Santalo point of a planar convex set (Q1802415) (← links)
- Minimum area circumscribing polygons (Q1822239) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- Using symbolic calculations to determine largest small polygons (Q2046342) (← links)
- Extremal convex polygons inscribed in a given convex polygon (Q2064020) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- Finding minimal enclosing boxes (Q3704926) (← links)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908) (← links)
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ (Q4819959) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle (Q5357503) (← links)
