Taxicab Geometry

Ok, Taxicab Geometry is deceptively simple. It’s exactly like Euclidean, except distance is defined as the sum of the absolute values of the diferences pf the corrdinates.
OR: d[sub]T[/sub] = |A[sub]X[/sub] - B[sub]X[/sub]| + |A[sub]Y[/sub] - B[sub]Y[/sub]| + |A[sub]Z[/sub] - B[sub]Z[/sub]| + …

And you define everyting based on locuses and distance. Circle is easy. A segment = {P | d[sub]T[/sub](P, A) + d[sub]T[/sub](P, B) = d[sub]T[/sub](A, B)}

Confused yet?

I’m so confued. What’s the point of this anyway? (both of the post and of the geomety…) :slight_smile:

  1. Would it be better off in the chit-chat forum?

  2. If you keep to integers, that distance formula is for traveling along right-angled, regularly spaced straight paths.
    it’s either really cool or really mind-boggling. frequently both. :yikes:
    (to start off, just use 2 dimensions, X & Y)

ok i think i got it

10-2=8 then you take a right at maple st. and then another right at North Pine and another right at Limestone and then another right at 4th. Wait I think I’m lost. :yikes:

This stuff is way to confusing for me.

Think of it as 1st street, 2nd, 3rd, 4th, etc.

Here’s an example of finding distance:

  1. Take a piece of graph paper.
  2. draw the points (A, B) and (C, D) (all four being integers)
  3. The distance between the points in Taxicab = abs(A - C) + abs(B - D)

Got it yet?

  1. Would it be better off in the chit-chat forum?

Nah. Its just odd and random math. Thats all.:slight_smile:

OK. I get it. (I had never heard of it before.) Now does it have some profound, practical application?

Can you explain this in English? I don’t understand how the equation defines a segment. (A segment of what?)

Also, in what way is a circle easy? I’m guessing you are defining a circle as being the locus of points equidistant from a given point. In that case, the “circle” will be a square turned diagonally, right?

So a “circle” is a square diamond in euclidian space.

[edit]Didn’t read gwross’s post! oops[/edit]

I’ve used this before in game programming.

Yes. and pi = 4. YIIIIPEEEEE! :smiley:

What’s this? (A personal favorite)

{P | d[sub]T[/sub](P, A) = d[sub]T[/sub](P, B)} :wink:
Some points to try it with
A, B
(0, 0), (4, 2)
(0, 0), (2, 4)
(0, 0), (3, 3) :wink:
(-1, 1), (4, 1)

I still don’t get it. Is your new formula, {P | d[sub]T[/sub](P, A) = d[sub]T[/sub](P, B)} supposed to be equivalent to your original one, {P | d[sub]T[/sub](P, A) + d[sub]T[/sub](P, B) = d[sub]T[/sub](A, B)}?

I would still like to know how you would read the(se?) equation(s?) out loud in English.

[EDIT]BTW, i think my only problem is with your notation. Not with the concepts of Taxicab Geometry.[/EDIT]

Correct me if I’m wrong, but the notation is just standard set notation. For example, {x in R | x > 2} would be read as “all x beloning to the set of real numbers such that x is greater than 2.”

Similarly, {P | d[sub]T[/sub](P, A) = d[sub]T[/sub](P, B)} would be the set off all points equidistant from two fixed points (A and B, in this case). Similarly, the set {P | dT(P, A) + dT(P, B) = dT(A, B)} would be the set of all points that are colinear with fixed points A and B (ie the sum of the distances from a point to each of the fixed points is the same as the total distance between the two fixed points).

Further examples:

{P | d[sub]T[/sub](P, A) = r} is the set of all points of fixed distance from A (ie a circle of radius r centered at A.)

{P | d[sub]T[/sub](P, A) + d[sub]T[/sub](P, B) = c} is an elipse

As for taxicab geometry, if this kind of thing interests you, there are entire branches of mathematics devoted to the study of non-Euclidean gemetry. I took half a semester of this stuff last year, so if you have any questions, please post and I’ll try to answer. Also, if you want to do more research on your own, the formal mathematical name for this kind of thing is a Metric Space.

I guess it’s just been way too long. :o

So what’s the profound application?

Or is it left as a “trivial exercise for the reader” :slight_smile:

I use Taxicab Geom. for game programming when I don’t need to be accurate or when I want to save a few clock cycles :wink:

Shouldn’t your definition for the taxicab distance (d[sub]T[/sub]) be written

d[sub]T[/sub](A, B) = |A[sub]X[/sub] - B[sub]X[/sub]| + |A[sub]Y[/sub] - B[sub]Y[/sub]| + |A[sub]Z[/sub] - B[sub]Z[/sub]| + …

And with Rob’s hints, I think I figured out your “segment” formula:

A segment = {P | d[sub]T[/sub](P, A) + d[sub]T[/sub](P, B) = d[sub]T[/sub](A, B)}

If I indeed understand it correctly, a “segment” turns out to be all points on or within a rectangle* with points A and B at opposite corners.

*Or a rectangular prism in three dimensions, or a rectangular hyper-prism in more than three.

Hmm … you lost me at “Ok” :stuck_out_tongue:

Hello, It’s been 13 years since I learned Taxi. Here is a better distance equation.

D = abs(P1x - p2x) + abs(P1y - p2y)

Or if you had two points (2,1) and (3,4) the distance would be 4. abs(2-3) + abs(1-4). There are four paths from one point to the other.

I just pulled out my “text” book on it. Its inventor is Eugene Krunse. He is (was maybe) a professor at the U of Michigan. (I have his e-mail if you need it).

The purpose of it is really to introduce people to Non-Euclidean Geometry, and was used for me as a warm up to a really hard Sr. Level College Geometry Course.

The circle (or the set of all points equal distance from a single point) turns out to be a square. However the perpendicular bisector (all points on a line perpendicular to another line and equal didtance to two points and the line) turns out really weird. Even weirder if the points on the first line are an odd length away from each other. If memory serves all of the conic shapes are represented.

Oh this brings back memories. Go Alice, Bruno, and Clyde!

-Jim

Yes! Really freaky and really cool at the same time.
(sorry I didn’t include arguments)

Anyone done this yet?

What’s this? (A personal favorite)

{P | d[sub]T[/sub](P, A) = d[sub]T[/sub](P, B)}
Some points to try it with
A, B
(0, 0), (4, 2)
(0, 0), (2, 4)
(0, 0), (3, 3)
(-1, 1), (4, 1)

I did (0,0)-(3,3) and circle with radius 3.

I wrote a VB program to do it :cool: .

Screen shots are attached. First one is (0,0)-(3,3), second is the “circle” with radius 3.







Wow! Did you just single-handedly solve the “squring the circle”](Circle Squaring -- from Wolfram MathWorld) problem? :smiley:

Anyway, for more information you might check this out.