Building bridges between convex regions

Authors:
Hee-Kap Ahn;Otfried Cheong;Chan-Su Shin
Affiliations:
Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands and Korea Institute of Science and Technology, South Korea;Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands;School of Electr. and Inform. Engineering, Hankuk University of Foreign Studies, South Korea
Venue:
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Year:
2003

Citing 12
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
On a multidimensional search technique and its application to the Euclidean one centre problem

SIAM Journal on Computing
Minimum diameter spanning trees and related problems

SIAM Journal on Computing
Approximation algorithms for the geometric covering salesman problem

Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry
Computing the optimal bridge between two convex polygons

Information Processing Letters
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
On optimal bridges between two convex regions

Information Processing Letters
Approximation algorithms for TSP with neighborhoods in the plane

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Minimax parametric optimization problems and multi-dimensional parametric searching

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On computing the optimal bridge between two convex polygons

Information Processing Letters
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Euclidean traveling salesman and buyers problem (TSBP), we are given a set of convex regions in d-dimensional space, and we wish to find a minimum-cost tour that visits all the regions. The cost of a tour depends on the length of the tour itself and on the distance that buyers within each region need to travel to meet the salesman. We show that constant-factor approximations to the TSBP and several similar problems ,can be obtained by visiting the centers of the smallest enclosing spheres of the regions.