Nancy,
On Thu, 22 Jun 2000, nancy collins wrote:
sorry if i've been missing the point.
Absolutely no need to apologize; you're doing ME the favor! :-)
can you explain to me if this is the
approximation you are talking about? take N identical 2D sheets
of quads, and stack them into a 3D
A picture is really worth a thousand words!
Tom
Speaking of that, does anyone know if this mailserver would block
attachments? A picture (like a jpg or something) probably would go a long
way right about now.
I think I know what you described, but I think that's exactly what Nancy
described to
BTW, I'll be out for the next week more or less, if anyone cares. I'm not
shunning any discussions! but you may not get a reply til I get back on Jul
5.
Chris Pelkie
Vice President/Scientific Visualization Producer
Conceptual Reality Presentations, Inc.
30 West Meadow Drive
Ithaca, NY 14850
Hi-
I am still having a dynamic linker problem with opendx-4.1.0. When I
execute dx -uionly I get:
BUG IN DYNAMIC LINKER ld.so: dl-version.c: 210: _dl_check_map_versions:
Assertion `needed != ((void *)0)' failed!
I am running Redhat v6.1. Following some advice I recevied from the
list, I made
Hi,
I'm not quite sure what the problem is, but I am currently running rh6.1
and opendx
$ rpm -q opendx
opendx-4.1.0-1
$ rpm -q glibc
glibc-2.1.2-11
$ rpm -q ld.so
ld.so-1.9.5-11
Everything seems to work just fine for me. Say, you did follow the README
and copy libstdc++ to
Yes! Nancy, great! Now I think I can describe my question simply. Take
the image generate by the script below... I'm looking at it right now.
See all of the connections and points which are necessary to describe the
circles? What I want to know is if the connections, i.e. the linear
paths
