Article View: sci.math.research
Article #194looking for an algorithm to separate domains with hyperplanes
From: Catherine Dezan
Date: Tue, 26 Jan 1993 11:23
Date: Tue, 26 Jan 1993 11:23
11 lines
1062 bytes
1062 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 in advance for any piece of information. Catherine Dezan. email : dezan@enstb.enst-bretagne.fr
Technical Details
Message-ID:
<281@enstb.enst-bretagne.fr>Path:
arc1-ca.pugleaf.net!sparky!uunet!portal!lll-winken!overload.lbl.gov!agate!spool.mu.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!danShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!portal!lll-winken!overload.lbl.gov!agate!spool.mu.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!dan From: dezan@enstb.enst-bretagne.fr (Catherine Dezan) Newsgroups: sci.math.research Subject: looking for an algorithm to separate domains with hyperplanes Keywords: geometry Message-ID: <281@enstb.enst-bretagne.fr> Date: 26 Jan 93 11:23:40 GMT Sender: Daniel Grayson <dan@math.uiuc.edu> Reply-To: dezan@enstb.enst-bretagne.fr Organization: Ecole Nationale Superieure des Telecommunications de Bretagne, Brest FRANCE Lines: 11 Approved: Daniel Grayson <dan@math.uiuc.edu> Originator: dan@symcom.math.uiuc.edu X-Submissions-To: sci-math-research@uiuc.edu X-Administrivia-To: sci-math-research-request@uiuc.edu