Article View: comp.theory
Article #1863looking for an algorithm...
From: Catherine Dezan
Date: Tue, 26 Jan 1993 11:09
Date: Tue, 26 Jan 1993 11:09
10 lines
783 bytes
783 bytes
I am looking for an algorithm which can separate n convex polyhedral domains (each one from others) with a minimal number of hyperplans. Does such an algorithm exist? What about its complexity? Thank you very much in advance for any information. Catherine Dezan. email : dezan@enstb.enst-bretagne.fr
Technical Details
Message-ID:
<279@enstb.enst-bretagne.fr>Path:
arc1-ca.pugleaf.net!sparky!uunet!mcsun!julienas!corton!enstb!lombarde!dezanShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!mcsun!julienas!corton!enstb!lombarde!dezan From: dezan@enstb.enst-bretagne.fr (Catherine Dezan) Newsgroups: comp.theory Subject: looking for an algorithm... Keywords: convex polyhedral domain Message-ID: <279@enstb.enst-bretagne.fr> Date: 26 Jan 93 11:09:51 GMT Sender: news@enstb.enst-bretagne.fr Reply-To: dezan@enstb.enst-bretagne.fr Organization: Ecole Nationale Superieure des Telecommunications de Bretagne, Brest FRANCE Lines: 10