comp.lang.idl-pvwave archive: archive » Looking for a 3D "triangulate" equivalent

Home » Public Forums » archive » Looking for a 3D "triangulate" equivalent

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Looking for a 3D "triangulate" equivalent [message #14656]

Mon, 15 March 1999 00:00

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

Report message to a moderator

[Message index]

		Looking for a 3D "triangulate" equivalent By: burkhard prause[1] on Mon, 15 March 1999 00:00
		Re: Looking for a 3D "triangulate" equivalent By: David Foster on Wed, 24 March 1999 00:00

Previous Topic:	statistics on large arrays
Next Topic:	DROPLIST problem in CW_FORM

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sun Nov 30 10:47:53 PST 2025

Total time taken to generate the page: 1.20516 seconds