An optimal algorithm for finding minimal enclosing triangles
From MaRDI portal
Recommendations
Cited in
(52)- A stabilized Powell-Sabin finite-element method for the 2D Euler equations in supersonic regime
- Minimum-perimeter enclosures
- Optimal Embedded and Enclosing Isosceles Triangles
- The use of Powell-Sabin B-splines in a higher-order phase-field model for crack kinking
- Weak imposition of Dirichlet boundary conditions for analyses using Powell-Sabin B-splines
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Stretch‐induced wrinkling analysis of thin sheets with splines
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Parallel computational geometry
- Linear algorithm to find the largest intriangles of a planar convex polygon
- An exact algorithm for constructing minimum Euclidean skeletons of polygons
- Construction and analysis of cubic Powell-Sabin B-splines
- Optimizing squares covering a set of points
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Optimizing squares covering a set of points
- Toward quantifying vertex similarity in networks
- TURNING SHAPE DECISION PROBLEMS INTO MEASURES
- A polynomial solution for the Potato-peeling problem
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- scientific article; zbMATH DE number 2169076 (Why is no real title available?)
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
- Optimal placement of convex polygons to maximize point containment
- Finding the maximum bounded intersection of k out of n halfplanes
- A new algorithm for the minimal-area convex enclosure problem
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- A B-spline basis for C^1 quadratic splines on triangulations with a 10-split
- Largest \(j\)-simplices in \(n\)-polytopes
- An algorithm for constructing locally optimal min-max triangulation
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
- Translating a convex polygon to contain a maximum number of points.
- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations
- Approximation of convex sets by polytopes
- Iterated nearest neighbors and finding minimal polytopes
- Computing shortest transversals
- Minimum Width Rectangular Annulus
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
- Finding minimal enclosing boxes
- Separating bichromatic point sets by minimal triangles with a fixed angle
- Perspectives of Monge properties in optimization
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Finding the smallest triangles containing a given convex polygon
- Extremal convex polygons inscribed in a given convex polygon
- Finding minimal convex nested polygons
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- An Algorithm to Compute Any Simple k-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Isoperimetric triangular enclosures with a fixed angle
- Minimum-area enclosing triangle with a fixed angle
- \(\mathcal{C}^1\) cubic splines on Powell-Sabin triangulations
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Minimum-width rectangular annulus
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- Energy conservation during remeshing in the analysis of dynamic fracture
This page was built for publication: An optimal algorithm for finding minimal enclosing triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745275)
