<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "https://jats.nlm.nih.gov/nlm-dtd/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="3.0" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">ISPRS-Annals</journal-id>
<journal-title-group>
<journal-title>ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences</journal-title>
<abbrev-journal-title abbrev-type="publisher">ISPRS-Annals</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">ISPRS Ann. Photogramm. Remote Sens. Spatial Inf. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2194-9050</issn>
<publisher><publisher-name>Copernicus Publications</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.5194/isprs-annals-XI-2-2026-429-2026</article-id>
<title-group>
<article-title>Road Network Vectorization With Geometric Enforcement</article-title>
</title-group>
<contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Zhu</surname>
<given-names>Zhenyu</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Di Bernardino</surname>
<given-names>Elena</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
</contrib>
<contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Lafarge</surname>
<given-names>Florent</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
</contrib>
</contrib-group><aff id="aff1">
<label>1</label>
<addr-line>Centre INRIA d’Université Côte d’Azur, Sophia-Antipolis, France</addr-line>
</aff>
<aff id="aff2">
<label>2</label>
<addr-line>Université Côte d’Azur, Laboratoire J.A. Dieudonné, Nice, France</addr-line>
</aff>
<pub-date pub-type="epub">
<day>03</day>
<month>07</month>
<year>2026</year>
</pub-date>
<volume>XI-2-2026</volume>
<fpage>429</fpage>
<lpage>437</lpage>
<permissions>
<copyright-statement>Copyright: &#x000a9; 2026 Zhenyu Zhu et al.</copyright-statement>
<copyright-year>2026</copyright-year>
<license license-type="open-access">
<license-p>This work is licensed under the Creative Commons Attribution 4.0 International License. To view a copy of this licence, visit <ext-link ext-link-type="uri"  xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link></license-p>
</license>
</permissions>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/XI-2-2026/429/2026/isprs-annals-XI-2-2026-429-2026.html">This article is available from https://isprs-annals.copernicus.org/articles/XI-2-2026/429/2026/isprs-annals-XI-2-2026-429-2026.html</self-uri>
<self-uri xlink:href="https://isprs-annals.copernicus.org/articles/XI-2-2026/429/2026/isprs-annals-XI-2-2026-429-2026.pdf">The full text article is available as a PDF file from https://isprs-annals.copernicus.org/articles/XI-2-2026/429/2026/isprs-annals-XI-2-2026-429-2026.pdf</self-uri>
<abstract>
<p>We present an automatic algorithm for graph-based road network extraction from remote sensing images. While existing works mostly focus on improving accuracy, we address the problem of the geometric quality of the output graphs. The state-of-the-art methods largely overlook this aspect by generating graphs without strong geometric guarantees, regularity preservation and low-complexity, which, ultimately, reduces their impact in many application scenarios. Our algorithm relies upon foundation models that analyze road networks with pixel-based representations, as well as geometric algorithms and data structures in charge of connecting geometric primitives into planar graphs. This hybrid strategy allows us to strongly enforce the geometric quality of the output graphs while bringing a high level of generalization. We show the potential of our algorithm and its advantages over existing methods on two datasets commonly-used in the field using both the conventional accuracy metrics and new metrics introduced to measure the geometric quality of the output graphs.</p>
</abstract>
<counts><page-count count="9"/></counts>
</article-meta>
</front>
<body/>
<back>
</back>
</article>