LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS

DOI10.1142/S0218195912500082zbMath1267.68263MaRDI QIDQ5300001

Haitao Wang, Danny Z. Chen

Publication date: 24 June 2013

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195912500082

zbMATH Keywords

facility location; algorithms design; separation problems; obnoxious line

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68W05: Nonnumerical algorithms

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Cites Work

• Separating and shattering long line segments
• Widest empty L-shaped corridor
• The maximin line problem with regional demand
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Geometric complexity of some location problems
• The widest k-dense corridor problems
• On the union of fat wedges and separating a collection of segments by a line
• Shattering a set of objects in 2D
• Topologically sweeping visibility complexes via pseudotriangulations
• On finding widest empty curved corridors
• Location of an Obnoxious Route
• Voronoi Diagram in the Laguerre Geometry and Its Applications
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computing the width of a set
• Ray Shooting Amidst Convex Polygons in 2D
• An optimal algorithm for intersecting line segments in the plane
• The K-dense corridor problems
• An Output-Sensitive Convex Hull Algorithm for Planar Objects
• Slowing down sorting networks to obtain faster sorting algorithms
• THE VISIBILITY COMPLEX