On finding widest empty curved corridors
From MaRDI portal
Publication:2385694
Recommendations
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- Computing a Largest Empty Anchored Cylinder, and Related Problems
- Computing largest empty circles with location constraints
- Computing obnoxious 1-corner polygonal chains
- Continuous location of dimensional structures.
- Finding the largest area axis-parallel rectangle in a polygon
- Geometric complexity of some location problems
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- On Finding the Maxima of a Set of Vectors
- On finding a widest empty 1-corner corridor
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- THE LARGEST EMPTY ANNULUS PROBLEM
- Widest empty L-shaped corridor
Cited in
(4)
This page was built for publication: On finding widest empty curved corridors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385694)