Base station placement on boundary of a convex polygon

DOI10.1016/J.JPDC.2007.08.005MaRDI QIDQ436692zbMATH OpenOpenAlexFDO

Authors Sasanka Roy, Debabrata Bardhan, 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

computational geometrywireless networkfarthest point Voronoi diagram

Mathematics Subject Classification ID

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

Recommendations

• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Distributed Computing – IWDC 2005
• Efficient algorithm for placing a given number of base stations to cover a convex region
• scientific article; zbMATH DE number 1629974
• scientific article; zbMATH DE number 2089212

Cites work

• scientific article; zbMATH DE number 1696646 (Why is no real title available?)
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• A near-linear algorithm for the planar 2-center problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• More planar two-center algorithms
• The discrete 2-center problem

Cited in

(15)

• scientific article; zbMATH DE number 1629974 (Why is no real title available?)
• THE ALIGNED K-CENTER PROBLEM
• 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 Euclidean \(k\)-supplier problem in \(I R^2\)
• Covering convex polygons by two congruent disks
• Constrained \(k\)-center problem on a convex polygon
• Covering convex polygons by two congruent disks
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Efficient algorithm for placing a given number of base stations to cover a convex region
• The discrete and mixed minimax 2-center problem
• Distributed Computing – IWDC 2005
• An approximation algorithm for \(k\)-center problem on a convex polygon
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436692)