Diagrams/GSoC
From HaskellWiki
(Difference between revisions)
(Added a couple of broad ideas.) |
|||
| Line 16: | Line 16: | ||
See also [[Diagrams/Dev/Paths]]. | See also [[Diagrams/Dev/Paths]]. | ||
| + | |||
| + | === Optimized Diagrams === | ||
| + | |||
| + | Tools for backends to remove redundant data? | ||
| + | |||
| + | === Constraint Based Diagrams === | ||
| + | |||
| + | Generate diagrams that meet some declarative constraint specification. | ||
Revision as of 21:07, 13 February 2013
It would be cool to get a Google Summer of Code student involved with diagrams somehow. Let's brainstorm some project ideas below!
More info:
- http://google-opensource.blogspot.com/2013/02/flip-bits-not-burgers-google-summer-of.html
- http://www.google-melange.com/gsoc/document/show/gsoc_program/google/gsoc2013/help_page
- http://www.google-melange.com/gsoc/events/google/gsoc2013
Contents |
1 Project ideas
1.1 GTK application for creating diagrams interactively
1.2 Path operations
Intersection, union, etc?
See also Diagrams/Dev/Paths.
1.3 Optimized Diagrams
Tools for backends to remove redundant data?
1.4 Constraint Based Diagrams
Generate diagrams that meet some declarative constraint specification.
