comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Looking for a 3D "triangulate" equivalent
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Switch to threaded view of this topic Create a new topic Submit Reply
Looking for a 3D "triangulate" equivalent [message #14656] Mon, 15 March 1999 00:00 Go to next message
burkhard prause[1] is currently offline  burkhard prause[1]
Messages: 1
Registered: March 1999
Junior Member
Hi everyone.

I have in the past used Triangulate to create adjacency lists for
irregular grids (centers of mass) in 2D. Now I have three dimensional
arrays, for which I need to do the same. There are many (some good, some
ugly) c/c++ routines out there that would perform delauney triangulation
on simplical vertices (finding minimal surface convex hulls), but unless
some have options that I don't know about, none that I know can give me
adjacency lists ("neighbors") for each point.

Does anyone know of such a routine, written in IDL (preferably, for ease
of use), or c for that matter? Where could I look for mathematical IDL
routines (in the future). I stop by the Johhs Hopkins library and David
Fannings (Hi David!) on occasion. What else is out there?

Burkhard
Re: Looking for a 3D "triangulate" equivalent [message #14768 is a reply to message #14656] Wed, 24 March 1999 00:00 Go to previous message
David Foster is currently offline  David Foster
Messages: 341
Registered: January 1996
Senior Member
burkhard prause wrote:
>
> Hi everyone.
>
> I have in the past used Triangulate to create adjacency lists for
> irregular grids (centers of mass) in 2D. Now I have three dimensional
> arrays, for which I need to do the same. There are many (some good, some
> ugly) c/c++ routines out there that would perform delauney triangulation
> on simplical vertices (finding minimal surface convex hulls), but unless
> some have options that I don't know about, none that I know can give me
> adjacency lists ("neighbors") for each point.
>
> Does anyone know of such a routine, written in IDL (preferably, for ease
> of use), or c for that matter? Where could I look for mathematical IDL
> routines (in the future). I stop by the Johhs Hopkins library and David
> Fannings (Hi David!) on occasion. What else is out there?
>
> Burkhard

Burkhard -

Everyone looking for IDL routines should check out Ray Sterner's
libraries first:

http://fermi.jhuapl.edu/s1r/idl/idl.html

I have a pretty long list of IDL resources on the net...I'll email
them to you offline.

Dave
--

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~~
David S. Foster Univ. of California, San Diego
Programmer/Analyst Brain Image Analysis Laboratory
foster@bial1.ucsd.edu Department of Psychiatry
(619) 622-5892 8950 Via La Jolla Drive, Suite 2240
La Jolla, CA 92037
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ~~~~~~
  Switch to threaded view of this topic Create a new topic Submit Reply
Previous Topic: statistics on large arrays
Next Topic: DROPLIST problem in CW_FORM

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 08 09:13:21 PDT 2025

Total time taken to generate the page: 0.00642 seconds