Base station placement on boundary of a convex polygon

DOI10.1016/j.jpdc.2007.08.005zbMath1243.68075OpenAlexW2007846378MaRDI QIDQ436692

Debabrata Bardhan, Sasanka Roy, Sandip Das

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.08.005

zbMATH Keywords

wireless networkcomputational geometryfarthest point Voronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14)

Related Items (11)

The Discrete and Mixed Minimax 2-Center Problem ⋮ The Euclidean \(k\)-supplier problem in \(I R^2\) ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ The discrete and mixed minimax 2-center problems ⋮ Some variations on constrained minimum enclosing circle problem ⋮ THE ALIGNED K-CENTER PROBLEM ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ An approximation algorithm for \(k\)-center problem on a convex polygon ⋮ Covering convex polygons by two congruent disks ⋮ Constrained k-Center Problem on a Convex Polygon ⋮ Covering convex polygons by two congruent disks

Cites Work

• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• The discrete 2-center problem
• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

This page was built for publication: Base station placement on boundary of a convex polygon