Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Python Geospatial Analysis Cookbook

You're reading from   Python Geospatial Analysis Cookbook Over 60 recipes to work with topology, overlays, indoor routing, and web application analysis with Python

Arrow left icon
Product type Paperback
Published in Nov 2015
Publisher
ISBN-13 9781783555079
Length 310 pages
Edition 1st Edition
Languages
Arrow right icon
Toc

Table of Contents (15) Chapters Close

Preface 1. Setting Up Your Geospatial Python Environment FREE CHAPTER 2. Working with Projections 3. Moving Spatial Data from One Format to Another 4. Working with PostGIS 5. Vector Analysis 6. Overlay Analysis 7. Raster Analysis 8. Network Routing Analysis 9. Topology Checking and Data Validation 10. Visualizing Your Analysis 11. Web Analysis with GeoDjango A. Other Geospatial Python Libraries
B. Mapping Icon Libraries
Index

Introduction


Routing has become commonplace on navigation devices for road networks across the world. If you want to know how to drive from point A to point B, simply enter the start address and end address into your navigation software and it will calculate the shortest route for you in seconds.

Here's a scenario you may come across: Route me to Prof. Dr. Smith's office in the Geography Department for my meeting at any university anywhere. Hmm, sorry, there's no routing network available on my navigation software. This is a reminder for you to not to forget to ask for directions on campus for your meeting location.

This chapter is all about routing and, specifically, routing inside large building complexes from office A33, first floor in building E01 to office B55, sixth floor in building P7.

We will explore the powerful routing capabilities of pgRouting, an extension of PostgreSQL. With pgRouting, we can calculate the shortest path using either the Dijkstra, A*, and/or K shortest path algorithms...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime