Creating a nicely directed triangular net
From: Toni Lassila (toni_at_nukespam.org)
Date: 03/04/05
- Next message: Daryl McCullough: "Re: an true information theory"
- Previous message: luiroto_at_yahoo.com: "Re: Triangular numbers, speculation"
- Next in thread: Keith A. Lewis: "Re: Creating a nicely directed triangular net"
- Reply: Keith A. Lewis: "Re: Creating a nicely directed triangular net"
- Reply: W. Dale Hall: "Re: Creating a nicely directed triangular net"
- Messages sorted by: [ date ] [ thread ]
Date: Fri, 04 Mar 2005 16:47:03 +0200
Assume an arbitrary polygon, dissected into a finite triangular net
with no hanging nodes. Then assign for each triangle T a direction of
traversal r(T), either clockwise (1) or anti-clockwise (-1), meaning
that the edges of the triangle must be traversed in that direction.
Under which conditions (for the net) can we assign the directions to
each triangle s.t. for any two adjacent triangles their common edge is
always traversed in the same direction for both triangles? In other
words, if two triangles are adjacent then their directions of
traversal are opposite, r(T1) = - r(T2).
-- "I'm not interested in mathematics that might have anything to do with reality." -- Russell Easterly, in sci.math
- Next message: Daryl McCullough: "Re: an true information theory"
- Previous message: luiroto_at_yahoo.com: "Re: Triangular numbers, speculation"
- Next in thread: Keith A. Lewis: "Re: Creating a nicely directed triangular net"
- Reply: Keith A. Lewis: "Re: Creating a nicely directed triangular net"
- Reply: W. Dale Hall: "Re: Creating a nicely directed triangular net"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
