University of Cambridge > Talks.cam > Computational and Digital Archaeology Lab (CDAL) > Contentious theories and computational approaches: A case study of the Harappan port Lothal and the Nal Corridor

Contentious theories and computational approaches: A case study of the Harappan port Lothal and the Nal Corridor

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Akshyeta Suryanarayan.

Lothal, a prominent port during the Bronze Age Harappan Civilisation (2600-1900 BCE ), is situated about 30 km inland from the Gulf of Khambhat on the western coast of India in Gujarat. The presence of a brick-walled ‘dockyard’ adds significance to the site. However, the function of this structure continues to be a topic of debate among archaeologists since its discovery in the 1950s by S R Rao. Another contentious issue in this region is the ‘seawater’ link via the Nal Corridor, connecting Little Rann to the Gulf of Khambhat. This study reexamines the dockyard and Nal Corridor theory by integrating early maps, multispectral/multitemporal satellite data, and Digital Elevation Models. Findings confirm the navigability of the Nal Corridor through interconnected waterbodies and reveal a direct connection between Lothal and the River Sabarmati, placing Lothal at an intersection of three important waterways. This study highlights the critical role of remote sensing in verifying and refining previously proposed interpretations while providing fresh perspectives that enhance our understanding of the past.

Venue: McDonald Institute Seminar Room, Downing Street, Cambridge CB2 3ER .

All welcome!

Register online for this talk: https://cam-ac-uk.zoom.us/meeting/register/tZYtcOihpzspGdeh2u7GOQl1P8JjtkZmpi7T#/registration

This talk is part of the Computational and Digital Archaeology Lab (CDAL) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity