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

Moved to Nextzen from Mapzen. #94

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Moved to Nextzen from Mapzen. #94

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
52c4212
Refactored from Mapzen to Nextzen.
RedTheKitsune Jul 3, 2018
18c6af0
Cleaned scene. I forgot to do it after testing.
RedTheKitsune Jul 3, 2018
0d86952
Fixed some warnings after importing to newer Unity.
RedTheKitsune Jul 3, 2018
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
9 changes: 0 additions & 9 deletions Assets/Dependencies/Mapbox/Earcut.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -113,7 +113,6 @@ private static void earcutLinked(Node ear, List<int> triangles, int dim, float m
}
}


private static bool isEarHashed(Node ear, float minX, float minY, float size)
{
var a = ear.prev;
Expand Down Expand Up @@ -251,7 +250,6 @@ private static Node cureLocalIntersections(Node start, List<int> triangles, int

if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a))
{

triangles.Add(a.i / dim);
triangles.Add(p.i / dim);
triangles.Add(b.i / dim);
Expand Down Expand Up @@ -348,7 +346,6 @@ private static Node sortLinked(Node list)

while (pSize > 0 || (qSize > 0 && q != null))
{

if (pSize != 0 && (qSize == 0 || q == null || p.mZOrder <= q.mZOrder))
{
e = p;
Expand All @@ -374,7 +371,6 @@ private static Node sortLinked(Node list)

tail.nextZ = null;
inSize *= 2;

} while (numMerges > 1);

return list;
Expand Down Expand Up @@ -439,7 +435,6 @@ private static Node FilterPoints(Node start, Node end)
p = end = p.prev;
if (p == p.next) return null;
again = true;

}
else
{
Expand Down Expand Up @@ -524,7 +519,6 @@ private static Node FindHoleBridge(Node hole, Node outerNode)
if (hx >= p.x && p.x >= mx && hx != p.x &&
pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y))
{

tan = Math.Abs(hy - p.y) / (hx - p.x); // tangential

if ((tan < tanMin || (tan == tanMin && p.x > m.x)) && locallyInside(p, hole))
Expand Down Expand Up @@ -630,7 +624,6 @@ private static Node insertNode(int i, float x, float y, Node last)
{
p.prev = p;
p.next = p;

}
else
{
Expand Down Expand Up @@ -703,7 +696,6 @@ public Data()

public class Node
{

/* Member Variables. */
public int i;
public float x;
Expand Down Expand Up @@ -777,6 +769,5 @@ protected Node getNextZNode()
{
return this.nextZ;
}

}
}
Loading