IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i3p293-304.html
   My bibliography  Save this article

Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths

Author

Listed:
  • Elena Fernandez

    (Universitat Politecnica de Catalunya, Barcelona, Spain)

  • Robert Garfinkel

    (University of Connecticut, Storrs, Connecticut)

  • Roman Arbiol

    (Institut Cartografic de Catalunya, Barcelona, Spain)

Abstract

The Cartographic Institute of Catalonia (ICC) produces commercial aerial photographic maps of locations in Europe and South America. These maps are often so large that it is necessary to produce one map from two or more photographs, which are combined two at a time in a process called mosaicking . The objective is to make the final map appear to be the product of a single photograph by producing a seam that is invisible even to an expert cartographer. The problem and a variation are modeled via bottleneck shortest paths and cycles. Optimization algorithms are developed for both, and the first has been implemented with demonstrable impact on the company. The second represents a new class of constrained shortest cycle problems.

Suggested Citation

  • Elena Fernandez & Robert Garfinkel & Roman Arbiol, 1998. "Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths," Operations Research, INFORMS, vol. 46(3), pages 293-304, June.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:3:p:293-304
    DOI: 10.1287/opre.46.3.293
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.3.293
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.3.293?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Oded Berman & Gabriel Y. Handler, 1987. "Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations," Transportation Science, INFORMS, vol. 21(2), pages 115-122, May.
    2. R. S. Garfinkel & A. W. Neebe & M. R. Rao, 1977. "The m-Center Problem: Minimax Facility Location," Management Science, INFORMS, vol. 23(10), pages 1133-1142, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Abraham P. Punnen & Ruonan Zhang, 2011. "Quadratic bottleneck problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 153-164, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bo Zhang & Jin Peng & Shengguo Li, 2021. "Minimax models for capacitated p-center problem in uncertain environment," Fuzzy Optimization and Decision Making, Springer, vol. 20(3), pages 273-292, September.
    2. Bhuvnesh Sharma & M. Ramkumar & Nachiappan Subramanian & Bharat Malhotra, 2019. "Dynamic temporary blood facility location-allocation during and post-disaster periods," Annals of Operations Research, Springer, vol. 283(1), pages 705-736, December.
    3. Joseph S. Martinich, 1988. "A vertex‐closing approach to the p‐center problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(2), pages 185-201, April.
    4. Xiang Li & Fahui Wang & Hong Yi, 2017. "A two-step approach to planning new facilities towards equal accessibility," Environment and Planning B, , vol. 44(6), pages 994-1011, November.
    5. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
    6. Berman, Oded & Sanajian, Nima & Wang, Jiamin, 2017. "Location choice and risk attitude of a decision maker," Omega, Elsevier, vol. 66(PA), pages 170-181.
    7. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    8. Gaar, Elisabeth & Sinnl, Markus, 2022. "A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem," European Journal of Operational Research, Elsevier, vol. 303(1), pages 78-98.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:46:y:1998:i:3:p:293-304. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.