looking for an algorithm to separate domains with hyperplanes

Thread View: sci.math.research

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Catherine Dezan Tue, 26 Jan 1993 11:23

#194

Author: Catherine Dezan
Date: Tue, 26 Jan 1993 11:23

11 lines
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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads