This is a working document showing specific near-term tasks needed for achieving the numbered milestones. It is not a wishlist of features to be included in future releases. Because people often work on whatever they feel like, this roadmap should only contain items that really have a good chance of being done for the next release (which means, somebody is actually working on them).

NOTE 1: Because this document became completely separated from reality, I replaced it with a more realistic version that reflects what we're actually doing. --Tweenk 13:45, 31 January 2010 (UTC)

Milestones 0-13 have been completed since the start of the Inkscape Project. See OldRoadmap

(DONE) Upgrade Windows devlibs to recent versions of GTK and GLib to fix several Windows bugs

Make the uninstaller work

Inkscape 0.49

0.49 will be a longer cycle focused on refactoring and new features.

(DONE) Merge GSoC 2010 work

Evaluate changing the numbering scheme to a date-based one, or setting more realistic goals for major (1.0, 2.0) releases

(DONE) Port renderer to Cairo (Krzysztof - GSoC 2010)

(DONE) Completely remove libnr

Introduce a backwards compatibility mechanism that will allow us to modify the XML representation of editing info. This is needed to bring the desktop coordinate system in line with SVG due to guideline and 3D box problems (they save desktop coordinates in the XML).

Using the above mechanism, make flowed text SVG-compliant.

Improve support for SVG switches: the first recognized element in a switch should appear directly in the SP tree, not as a child of the switch element.

Improve support for changing the name of the XML element node in response to SP tree changes.

Long term goals

Better modularization: separate the Inkscape codebase into several libraries that could be used by other programs.

General refactoring: make Inkscape a joy to develop.

SP tree refactoring: Port the object tree to C++ objects.

XML refactoring: Remove direct manipulation of XML from as many places as possible and replace it with SP tree methods.