#11564: Implement polyhedron unfolding (i.e net)
---------------------------+------------------------------------------------
Reporter: QuantumKing | Owner: mhampton
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.7.2
Component: geometry | Keywords: unfolding, net
Work_issues: | Upstream: N/A
Reviewer: | Author: QuantumKing
Merged: | Dependencies:
---------------------------+------------------------------------------------
Comment(by mhampton):
Sorry, I am traveling right now and its hard to find time for Sage
development. I do have some comments though.
Not all the functions in your patch have documentation/doctests. These
are mandatory for every function, so they need to be added.
I think it will make sense to merge our efforts. I haven't completely
fixed up my student's effort but I am attaching the current state so you
can take a look at what we did. There are different strengths and
weaknesses in our efforts. Ours can handle tougher problems, but we don't
have a function to check for overlaps.
If you haven't looked at the master's thesis of Schlickenrieder
(http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.28.2631&rep=rep1&type=pdf)
I highly recommend it. It was based on his work that my student choose to
implement the steepest-edge algorithm.
A good test problem is what Schlickenrieder calls "turtles", for example:
{{{
tpoints = [[i,j,i^2+j^2] for i in srange(-5,6,1) for j in srange(-5,6,1)]
tp = Polyhedron(vertices=tpoints)
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11564#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
