Skip to content
Finding nested triangles with the largest possible area from a set of points
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
images
README.md
area.html
bellevue.json
cougar.json
dedupe.py
dtb.json
dtbp.json
dtbpcpk.json
index.html
jimi.json
landing.json
outer_triangle.html
portal_entry.html
portals.json
renton.json
seattle.json
seattlecenter.json
select_triangle.html

README.md

maxmu

Given a set of points (in lat,lng), find the largest area triangle. From the set of points within that triangle (including 2 of the three outer triangle vertices), find the second largest triangle. Repeat until there are no points within the innermost triangle. In the degenerate case, this will yield a standard layered field, but in the typical case the spine will be non-continuous. Build the field inside out, creating the triangle first and then linking to the third portal of the inner triangle. [EDIT: This summary is still largely correct, but during development I found maintaing different sets of input points to be bothersome and so changed it to use a set of all points with the user supplying the outer bounds of the area of interest.]

You can’t perform that action at this time.