I thought the union command made sense, but I think I understand why
you don't like it.
as I understood it, p1.union(p2) currently returns the convex hull of the
vertices of p1 and p2. and _not_ the set union of p1 and p2. So I wonder
1) is this method really worth existing ? (it is 1 line
2008/12/12 mhampton hampto...@gmail.com:
Oh, I forgot one to address one thing: cddlib is used as a seperate
process, and not wrapped, just because of my lack of skills. Since
its a standard component library it should be used in a smarter way, I
just haven't gotten around to learning how.
On Dec 12, 1:15 am, Sébastien Barthélemy
sebastien.barthel...@gmail.com wrote:
2008/12/12 mhampton hampto...@gmail.com:
Hi,
Oh, I forgot one to address one thing: cddlib is used as a seperate
process, and not wrapped, just because of my lack of skills. Since
its a standard component
On Dec 12, 3:15 am, Sébastien Barthélemy
sebastien.barthel...@gmail.com wrote:
Do you know this (LGPLed) work:http://cens.ioc.ee/projects/polyhedron/
It wraps some of cddlib functions in python and also provide a higher level
python class. I never tried it though.
I found it on the cddlib
On Dec 12, 1:10 am, Sébastien Barthélemy
sebastien.barthel...@gmail.com wrote:
Hi,
SNIP
Where is your patch? Is it on trac somewhere? - if so I can't find
it.
I forgot to attach it to my email, sorry. I just requested a trac account,
That one should work now.
I'll put it there for
Yep, have you tried contacting the author? We actually have a bunch of
improvements to cddlib's build system to whom the author never
responded. See #3304 for example. If you have any better luck with
contact please let us know.
No.
However, I had contact with the maintainer of the matlab
On Dec 12, 6:58 am, Sébastien Barthélemy
sebastien.barthel...@gmail.com wrote:
Hi Sébastien
Yep, have you tried contacting the author? We actually have a bunch of
improvements to cddlib's build system to whom the author never
responded. See #3304 for example. If you have any better luck
Yet another question: see no reason why unbounded polyhedra are not
handled by mink_sum()
def mink_sum(polyhedra_list, verbose = False):
Returns the Minkowski sum of a list of polyhedra.
TODO: currently only works for polytopes, not unbounded polyhedra
Currently, the vertices
Yet another question: see no reason why unbounded polyhedra are not
handled by mink_sum()
def mink_sum(polyhedra_list, verbose = False):
Returns the Minkowski sum of a list of polyhedra.
TODO: currently only works for polytopes, not unbounded polyhedra
Currently, the vertices
That should work. As I said, I only use bounded polytopes so some of
my code is badly vertex-oriented.
You can submit a patch as above and I will review it. It is good to
have relatively small patches since they are easier to test.
I saw I just missed you on IRC, I am usually logged in but
Thanks very much for taking a look at polyhedra.py. I really enjoy
working on it, and I have some research interests in polyhedra, but I
am not a deep expert in the subject and I have been hoping for
constructive criticism and help.
I thought the union command made sense, but I think I
Oh, I forgot one to address one thing: cddlib is used as a seperate
process, and not wrapped, just because of my lack of skills. Since
its a standard component library it should be used in a smarter way, I
just haven't gotten around to learning how. Most of them time I use
it for relatively big
12 matches
Mail list logo
