[MWForum]Calling mathcats: geometry help please
Jeff Knope
mwforum@lists.mathcats.com
Wed, 11 Aug 2004 17:41:53 -0700
This is a multi-part message in MIME format.
------=_NextPart_000_0008_01C47FCA.7D766910
Content-Type: text/plain;
charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable
Hi ~
I just fired up OE to write this. But in comes Daniel and Wendy's =
discussion of the Reference Card. Wow! You took me seriously? Just =
kidding. I haven't gone to the PDF yet, but as soon as I get the =
following off my chest I will.
I need some help writing (or finding) a MW algorithm for Intersection of =
2 lines. The input list is likely of a form similar to this: [[[x1 =
y1][x2 y2]] [[x3 y3][x4 y4]]], where 1's and 2's are a pair of points on =
a line; and 3's and 4's are a pair of points on another (non-parallel) =
line. The output is the "shared point" - or intersection.
Googling around, there appear to be a few ways to go about it. The most =
simple and direct of them appears to be the algebraic solution of 2 =
simultaneous equations. Trouble is, as I examine my own (weak) processes =
for doing that, I find I'm doing lots of visual scanning for =
opportunities to algebraically reduce the expressions. It's a kind of =
intuitive process I haven't the faintest idea how to reduce MW =
procedures.
Maybe that's why there's those more esoteric approaches. Anyway, this is =
a common function. Most any CAD program has it working in one way or =
another in many different commands.
So who better to ask than the mathcats?
Thank you, --Jeff
------=_NextPart_000_0008_01C47FCA.7D766910
Content-Type: text/html;
charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3D"text/html; =
charset=3Dwindows-1252"><BASE=20
href=3D"file://C:\Program Files\Common Files\Microsoft =
Shared\Stationery\">
<STYLE>BODY {
MARGIN-TOP: 50px; FONT-SIZE: 10pt; MARGIN-LEFT: 50px; COLOR: #800000; =
FONT-FAMILY: Arial
}
</STYLE>
<META content=3D"MSHTML 6.00.2800.1458" name=3DGENERATOR></HEAD>
<BODY bgColor=3D#f2f0e2 background=3D"">
<DIV>Hi ~</DIV>
<DIV> </DIV>
<DIV>I just fired up OE to write this. But in comes Daniel and Wendy's=20
discussion of the Reference Card. Wow! You took me seriously? Just =
kidding. I=20
haven't gone to the PDF yet, but as soon as I get the following off my =
chest I=20
will.</DIV>
<DIV> </DIV>
<DIV>I need some help writing (or finding) a MW algorithm for=20
<STRONG>Intersection of 2 lines</STRONG>. The input list is=20
likely of a form similar to this: [[[x1 y1][x2 y2]] [[x3 =
y3][x4=20
y4]]], where 1's and 2's are a pair of points on a line; and 3's and 4's =
are a=20
pair of points on another (non-parallel) line. The output is the "shared =
point"=20
- or intersection.</DIV>
<DIV> </DIV>
<DIV>Googling around, there appear to be a few ways to go about it. The =
most=20
simple and direct of them appears to be the algebraic =
solution of=20
2 simultaneous equations. Trouble is, as I examine my own (weak) =
processes for=20
doing that, I find I'm doing lots of visual scanning for =
opportunities to=20
algebraically reduce the expressions. It's a kind of intuitive =
process I=20
haven't the faintest idea how to reduce MW procedures.</DIV>
<DIV> </DIV>
<DIV>Maybe that's why there's those more esoteric approaches. Anyway, =
this is a=20
common function. Most any CAD program has it working in one way or =
another=20
in many different commands.</DIV>
<DIV> </DIV>
<DIV>So who better to ask than the mathcats?</DIV>
<DIV> </DIV>
<DIV>Thank you, --Jeff</DIV>
<DIV> </DIV>
<DIV> </DIV></BODY></HTML>
------=_NextPart_000_0008_01C47FCA.7D766910--