Help for Algorithm!

Article View: bln.sci.mathematik

Article #592

Back to bln.sci.mathematik Previous Next

#592

From: Xue-Jun PEI
Date: Fri, 10 Jan 1997 00:00

15 lines
840 bytes

Hi netters,

I just have a question to a possible algorithm to solve the following problem:

Given a set of points in a 3-D room, is there any (and only one) flat, and the
sum of distances from these points to the flat is the minimum? If yes, how to
get the flat?

Can anyone over there give me algorithm or hint? Please send email to

mackpei@cs.tu-berlin.de


Thanks in advance!

Technical Details

Message-ID: <5b5pvc$aq3$1@news.cs.tu-berlin.de>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: f6df2,170853cf9c2fdda1,start
X-Google-Attributes: gidf6df2,public
From: mackpei@cs.tu-berlin.de (Xue-Jun PEI)
Subject: Help for Algorithm!
Date: 1997/01/10
Message-ID: <5b5pvc$aq3$1@news.cs.tu-berlin.de>
X-Deja-AN: 209062902
organization: Technical University of Berlin, Germany
content-type: text/plain; charset=iso-8859-1
mime-version: 1.0
newsgroups: bln.sci.mathematik