Determining the minimum-area encasing rectangle for an arbitrary closed curve
From MaRDI portal
Publication:4066653
DOI10.1145/360881.360919zbMath0308.68084OpenAlexW2038184042WikidataQ57258295 ScholiaQ57258295MaRDI QIDQ4066653
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360881.360919
Related Items
Finding minimal enclosing boxes, An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), A distribution-free TSP tour length estimation model for random graphs, Reconfigurable meshes and image processing, On Computing a Largest Empty Arbitrarily Oriented Rectangle, AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗, On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain, Parallel computational geometry, Solution approaches to irregular nesting problems, A new algorithm for the minimal-area convex enclosure problem, Algorithms for nesting with defects, Shape elongation from optimal encasing rectangles, Arbitrary-oriented color spanning region for line segments, Finding the largest area rectangle of arbitrary orientation in a closed contour, Solving a class of multiplicative programs with 0-1 knapsack constraints, Computing convexity properties of images on a pyramid computer, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers, A finite volume penalty based segment-to-segment method for frictional contact problems, A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane, The convergence rate of the sandwich algorithm for approximating convex functions, Packing problems, Boundary based shape orientation, Covering a set of points in a plane using two parallel rectangles, Two-dimensional profile-packing approach for multi-torch flame cutting, On the reverse Loomis-Whitney inequality, A note on the all nearest-neighbor problem for convex polygons, COVERING A POINT SET BY TWO DISJOINT RECTANGLES, On the reverse dual Loomis-Whitney inequality, Minimum area circumscribing polygons, Convex hull of a planar set of straight and circular line segments, An approximate algorithm for computing multidimensional convex hulls, EFFICIENT APPROXIMATION OF CONVEX POLYGONS, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
