Approximation algorithms for hitting objects with straight lines
Discrete Applied Mathematics
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Quickest paths, straight skeletons, and the city Voronoi diagram
Proceedings of the eighteenth annual symposium on Computational geometry
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Shortest paths and voronoi diagrams with transportation networks under general distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Optimal construction of the city voronoi diagram
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Bichromatic 2-center of pairs of points
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
Given two sets of points in the plane, we are interested in locating a highway hsuch that an objective function on the city distancebetween points of the two sets is minimized (where the city distance is measured with speed v 1 on a highway and 1 in the underlying metric elsewhere). Extending the results of Ahn et al. ([7]), we consider the option that there are already some built highways. We give a unified approach to this problem to design polynomial-time algorithms for several combinations of objective functions and types of the inserted highway (turnpikeor freeway).