Home Products Download Order Contacts

comp.graphics.algorithms

Subject: Re: Distance between two line segments in 3D



A logically/algorithmically correct algorithm is here:

http://www.fho-emden.de/~hoffmann/xsegdist03072004.pdf

The algorithm fails numerically for extraordinarily large
ranges for the segment end points, e.g. for line segments
with lengths in the region of 10^8.

This is so because the SQUARED distance is minimized.

If the geometry is somewhat normalized - all end points
are in a cube with edge length 10^4...10^6 - then the algorithm
is OK for all practical purposes (double precision assumed)

Best regards --Gernot Hoffmann


Reply


View All Messages in comp.graphics.algorithms

path:
Distance between two line segments in 3D =>

Replies:
Re: Distance between two line segments in 3D

Copyright 2006 WatermarkFactory.com. All Rights Reserved.