On finding widest empty curved corridors
From MaRDI portal
Publication:2385694
DOI10.1016/J.COMGEO.2007.02.003zbMATH Open1135.65008OpenAlexW1969015583MaRDI QIDQ2385694FDOQ2385694
Authors: Sergey Bereg, Carlos Seara, I. Ventura, J. M. Díaz-Báñez
Publication date: 12 October 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.02.003
Recommendations
Cites Work
- Title not available (Why is that?)
- On Finding the Maxima of a Set of Vectors
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Continuous location of dimensional structures.
- Computing obnoxious 1-corner polygonal chains
- Computing largest empty circles with location constraints
- Computing a Largest Empty Anchored Cylinder, and Related Problems
- THE LARGEST EMPTY ANNULUS PROBLEM
- Geometric complexity of some location problems
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- Widest empty L-shaped corridor
- Finding the largest area axis-parallel rectangle in a polygon
- On finding a widest empty 1-corner corridor
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
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)