[Date Index] [Thread Index] [Author Index]

RE: 3D problem

• To: mathgroup@smc.vnet.net
• Subject: [mg10692] RE: [mg10640] 3D problem
• From: Jean-Marie THOMAS <jmthomas@cybercable.tm.fr>
• Date: Fri, 30 Jan 1998 04:24:29 -0500
• Return-Receipt-To: Jean-Marie THOMAS <jmthomas@cybercable.tm.fr>

See Di`screteMath`ComputationalGeometry`, there is a function for the
nearest neighbour.

Hope this helps,
-----------------------------------------------

Jean-Marie THOMAS
Conseil et Audit en Ingenierie de Calcul jmthomas@cybercable.tm.fr
+33 (0)3 88 32 93 64
www.cybercable.tm.fr/~jmthomas
=======================


-----Message d'origine-----
De:	Russell Towle [SMTP:rustybel@foothill.net] Date:	mardi 27 janvier
1998 09:10
A:	mathgroup@smc.vnet.net
Objet:	[mg10640] 3D problem

Hi all,

I am translating polygons an unknown distance in 3-space; it may happen
that a vertex of one polygon will fall into coincidence with a vertex
of another polygon; what is the most efficient way to discover such a
point, and therefore the special distance of translation?

Russell Towle
Giant Gap Press:  books on California history, digital topographic maps
P.O. Box 141
Dutch Flat, California 95714
------------------------------
Voice:  (916) 389-2872
e-mail:  rustybel@foothill.net
------------------------------