Exact solutions to the Weighted Region Problem
<|reference_start|>Exact solutions to the Weighted Region Problem: In this paper, we consider the Weighted Region Problem. In the Weighted Region Problem, the length of a path is defined as the sum of the weights of the subpaths within each region, where the weight of a subpath is its Euclidean length multiplied by a weight $ \alpha \geq 0 $ depending on the region. We study a restricted version of the problem of determining shortest paths through a single weighted rectangular region. We prove that even this very restricted version of the problem is unsolvable within the Algebraic Computation Model over the Rational Numbers (ACMQ). On the positive side, we provide the equations for the shortest paths that are computable within the ACMQ. Additionally, we provide equations for the bisectors between regions of the Shortest Path Map for a source point on the boundary of (or inside) the rectangular region.<|reference_end|>
@article{de berg2024exact,
    title={Exact solutions to the Weighted Region Problem},
    author={Sarita de Berg and Guillermo Esteban and Rodrigo I. Silveira and Frank
  Staals},
    journal={arXiv preprint arXiv:2402.12028},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.12028},
    primaryClass={cs.CG}
}