**comp.graphics.algorithms**

## Subject: **A Geometry Problem**

Give a set of points in 3D Space {Vi: 1 = 1,2,...,n}, find the point

Va, a (- {1,2,...,n} to minimize

distance = sum||Va-Vi||

i=1,..n

to design a O(n^2)algorithm is easy , is there fast algorighm, for

example O(n*logn)

Reply

View All Messages in

**comp.graphics.algorithms**

path:

Replies:

Re: A Geometry Problem

Re: A Geometry Problem

Copyright © 2006 WatermarkFactory.com. All Rights Reserved.