Locating an Obnoxious Line among Planar Objects

Authors:
Danny Z. Chen;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, USA 46556
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 9
Cited 0

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
The K-dense corridor problems

Pattern Recognition Letters
A convex hull algorithm for discs, and applications

Computational Geometry: Theory and Applications
Widest empty L-shaped corridor

Information Processing Letters
The widest k-dense corridor problems

Information Processing Letters
Introduction to Algorithms

Introduction to Algorithms
Widest-corridor problems

Nordic Journal of Computing
On finding widest empty curved corridors

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Given a set P of n points in the plane such that each point has a positive weight, we study the problem of finding an obnoxious line that intersects the convex hull of P and maximizes the minimum weighted Euclidean distance to all points of P. We also consider a variant of this problem whose input is a set of m polygons with totally n vertices in the plane such that each polygon has a positive weight and whose goal is to locate an obnoxious line with respect to the weighted polygons. We improve the previous results for both problems. Our algorithms are based on new geometric observations and interesting algorithmic techniques.