A probabilistic relaxation approach for matching road networks

Author： Yang Bisheng   Zhang Yunfei   Luan Xuechen  

Publisher： Taylor & Francis Ltd

ISSN： 1365-8824

Source： International Journal of Geographical Information Science, Vol.27, Iss.2, 2013-02, pp. : 319-338

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Ad hoc matching of vectorial road networks

By Safra E.   Kanza Y.   Sagiv Y.   Doytsher Y.  

International Journal of Geographical Information Science, Vol. 27, Iss. 1, 2013-01 ,pp. : 114-153

Taylor & Francis Ltd

Access to resources Recommend Favorite

Matching spatial data sets: a statistical approach

By Walter Volker   Fritsch Dieter  

International Journal of Geographical Information Science, Vol. 13, Iss. 5, 1999-07 ,pp. : 445-473

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding shortest paths on real road networks: the case for A*

By Zeng W.   Church R. L.  

International Journal of Geographical Information Science, Vol. 23, Iss. 4, 2009-04 ,pp. : 531-543

Taylor & Francis Ltd

Access to resources Recommend Favorite

Within Skyline Query Processing in Dynamic Road Networks

By Huang Yuan-Ko  

ISPRS International Journal of Geo-Information, Vol. 6, Iss. 5, 2017-04 ,pp. : 137-137

MDPI

Access to resources Recommend Favorite

Georeferencing locality descriptions and computing associated uncertainty using a probabilistic approach

By Guo Q.   Liu Y.   Wieczorek J.  

International Journal of Geographical Information Science, Vol. 22, Iss. 10, 2008-01 ,pp. : 1067-1090

Taylor & Francis Ltd

Access to resources Recommend Favorite