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

Cited in

(40)

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

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)