Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix typo in filenames #1

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Fix typo in filenames #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions gtfs-book/ch-15-optimizing-shapes.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,13 +36,13 @@ their message to your users.
Consider the following shape from Portland that has been rendered using
Google Maps. The total shape consists of 1913 points.

![Original Shape](images/shape-original.jpg)
![Original Shape](images/shape-original.jpeg)

Compare this now to the same shape that has had redundant points
removed. The total number of points in this shape is 175, which
represents about a 90% reduction.

![Reduced Shape](images/shape-reduced.jpg)
![Reduced Shape](images/shape-reduced.jpeg)

If you look closely, you can see some minor loss of detail, but for the
most part, the shapes are almost identical.
Expand Down Expand Up @@ -73,7 +73,7 @@ data, while a lower tolerance discards more data.*

The following diagram shows what orthogonal distance means.

![Orthogonal Distance](images/orthogonal-distance.jpg)
![Orthogonal Distance](images/orthogonal-distance.jpeg)

The following resources provide more information about the
Douglas-Peucker Algorithm and describe how to implement it in your own
Expand Down