On finding widest empty curved corridors

DOI10.1016/J.COMGEO.2007.02.003MaRDI QIDQ2385694zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

collision detectioncorridorfacility locationgeometric optimizationwidest \(\alpha\)-siphon problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

The widest \(\alpha\)-siphon problem is solved. The widest \(\alpha\)-siphon is defined as the locus of points in the plane that are placed at the largest distance from a 1-corner polygonal chain. The 1-corner polygonal chain consists of two half-lines emanating form the corner and forming the angle \(\alpha\), \(0\leq\alpha\leq\pi\). The boundaries of the \(\alpha\)-siphon are formed by two half-lines or by a circular arc joining two half-lines. No points lie in the interior of the \(\alpha\)-siphon. Therefore, the \(\alpha\)-siphon splits the set of points in two non-trivial partitions. In the article, three variants of the widest \(\alpha\)-siphon problem are studied: 1) the widest oriented \(\alpha\)-siphon (the angle \(\alpha\) and the orientation of one of the half-lines are given), 2) the widest arbitrarily-oriented \(\alpha\)-siphon (the angle \(\alpha\) is given), 3) the widest anchored and arbitrarily-oriented \(\alpha\)-siphon (corner of polygonal chain is anchored at a given point).

Recommendations

• On finding a widest empty 1-corner corridor
• Improved algorithm for the widest empty 1-corner corridor
• Improved Algorithm for a Widest 1-Corner Corridor
• Some aperture-angle optimization problems
• Curvature-bounded traversals of narrow corridors

Cites work

• 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
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• On Computing a Largest Empty Arbitrarily Oriented Rectangle
• On finding a widest empty 1-corner corridor
• On finding an empty staircase polygon of largest area (width) in a planar point-set
• On Finding the Maxima of a Set of Vectors
• THE LARGEST EMPTY ANNULUS PROBLEM
• Widest empty L-shaped corridor

Cited in

(4)

• Locating an obnoxious line among planar objects
• Between Broadway and the Hudson: A Bijection of Corridor Paths
• On finding a widest empty 1-corner corridor
• Improved algorithm for the widest empty 1-corner corridor

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)