Finding the largest area axis-parallel rectangle in a polygon
From MaRDI portal
Publication:676593
DOI10.1016/0925-7721(95)00041-0zbMATH Open0869.68111OpenAlexW2045509593MaRDI QIDQ676593FDOQ676593
Authors: Karen E. Daniels, Victor J. Milenkovic, Dan Roth
Publication date: 4 September 1997
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00041-0
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Medial Axis Transformation of a Planar Shape
- Geometric applications of a matrix-searching algorithm
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- A polynomial solution for the Potato-peeling problem
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Title not available (Why is that?)
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
- The orthogonal convex skull problem
- Computing the Largest Empty Rectangle
- On the maximum empty rectangle problem
- A geometric consistency theorem for a symbolic perturbation scheme
- An Almost Linear Time Algorithm for Generalized Matrix Searching
- On rectangular visibility
- Title not available (Why is that?)
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
Cited In (22)
- Peeling meshed potatoes
- Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon
- Maximum-area and maximum-perimeter rectangles in polygons
- Finding largest rectangles in convex polygons
- Recognition of largest empty orthoconvex polygon in a point set
- Peeling potatoes near-optimally in near-linear time
- Title not available (Why is that?)
- Finding a largest rectangle inside a digital object and rectangularization
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Largest area parallelogram inside a digital object in a triangular grid
- Large \(k\)-gons in a 1.5D terrain
- Finding the largest area rectangle of arbitrary orientation in a closed contour
- Determining a set of maximum inscribed rectangles for label placement in a region
- Computing a maximum axis-aligned rectangle in a convex polygon
- Largest inscribed rectangles in convex polygons
- On finding widest empty curved corridors
- Motion smoothing strategies for 2D video stabilization
- Finding maximum edge bicliques in convex bipartite graphs
- Faster algorithms for largest empty rectangles and boxes
- 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
- Placing Text Boxes on Graphs
This page was built for publication: Finding the largest area axis-parallel rectangle in a polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676593)