Determining the minimum-area encasing rectangle for an arbitrary closed curve

Cited In (37)

Parallel computational geometry
Solving a class of multiplicative programs with 0-1 knapsack constraints
An approximate algorithm for computing multidimensional convex hulls
Boundary based shape orientation
Minimum area circumscribing polygons
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Affine linear parameter-varying embedding of non-linear models with improved accuracy and minimal overbounding
Solution approaches to irregular nesting problems
A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
On the reverse dual Loomis-Whitney inequality
AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
A finite volume penalty based segment-to-segment method for frictional contact problems
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
A new algorithm for the minimal-area convex enclosure problem
Reconfigurable meshes and image processing
On the reverse Loomis-Whitney inequality
Finding the largest area rectangle of arbitrary orientation in a closed contour
Arbitrary-oriented color spanning region for line segments
A distribution-free TSP tour length estimation model for random graphs
Covering a set of points in a plane using two parallel rectangles
Algorithms for nesting with defects
Shape elongation from optimal encasing rectangles
Packing problems
Finding minimal enclosing boxes
Computing convexity properties of images on a pyramid computer
Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
Covering a point set by two disjoint rectangles
A note on the all nearest-neighbor problem for convex polygons
EFFICIENT APPROXIMATION OF CONVEX POLYGONS
Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
On Computing a Largest Empty Arbitrarily Oriented Rectangle
Convex hull of a planar set of straight and circular line segments
Linear programming approaches to the convex hull problem in $\mathbb{R}^ m$
The convergence rate of the sandwich algorithm for approximating convex functions
Two-dimensional profile-packing approach for multi-torch flame cutting

This page was built for publication: Determining the minimum-area encasing rectangle for an arbitrary closed curve

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066653)