Pages that link to "Item:Q3745275"
From MaRDI portal
The following pages link to An optimal algorithm for finding minimal enclosing triangles (Q3745275):
Displaying 42 items.
- Isoperimetric triangular enclosures with a fixed angle (Q375380) (← links)
- Minimum-width rectangular annulus (Q388105) (← links)
- 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)
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet (Q948647) (← 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)
- 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)
- 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)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Finding minimal convex nested polygons (Q1822960) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- A stabilized Powell-Sabin finite-element method for the 2D Euler equations in supersonic regime (Q1986295) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← links)
- The use of Powell-Sabin B-splines in a higher-order phase-field model for crack kinking (Q2033616) (← 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)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Minimum Width Rectangular Annulus (Q3004689) (← links)
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance (Q3183457) (← links)
- Finding the smallest triangles containing a given convex polygon (Q3697817) (← links)
- Finding minimal enclosing boxes (Q3704926) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES (Q4669615) (← 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)
- Toward Quantifying Vertex Similarity in Networks (Q4985357) (← 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)
- Stretch‐induced wrinkling analysis of thin sheets with splines (Q6092111) (← links)
- Energy conservation during remeshing in the analysis of dynamic fracture (Q6549923) (← links)
- Weak imposition of Dirichlet boundary conditions for analyses using Powell-Sabin B-splines (Q6554041) (← links)
