“Dynamic planar map illustration” by Asente, Schuster and Pettit

  • ©Paul Asente, Mike Schuster, and Teri Pettit




    Dynamic planar map illustration



    There are many types of illustrations that are easier to create in planar-map-based illustration systems than in the more common stacking-based systems. One weakness shared by all existing planar-map-based systems is that the editability of the drawing is severely hampered once coloring has begun. The paths that define the areas to be filled become divided wherever they intersect, making it difficult or impossible to edit them as a whole.Live Paint is a new metaphor that allows planar-map-based coloring while maintaining all the original paths unchanged. When a user makes a change, the regions and edges defined by the new paths take on fill and stroke attributes from the previous regions and edges. This results in greater editing flexibility and ease of use. Live Paint uses a set of heuristics to match each region and edge in a changed illustration with a region or edge in the previous version, a task that is more difficult than it at first appears. It then transfers fill and stroke attributes accordingly.


    1. Adobe Systems Inc. 2005. Adobe Illustrator CS2 User Guide. Adobe Systems Inc.Google Scholar
    2. Alt, H., Efrat, A., Rote, G., and Wenk C. 2003. Matching Planar Maps. In Journal of Algorithms, 49, 2, 262–283. Google ScholarDigital Library
    3. Baudelaire, P. and Gangnet, M. 1989. Planar Maps: An Interaction Paradigm for Graphic Design. In CHI’89 Proceedings, Addison-Wesley, 313–318. Google ScholarDigital Library
    4. Bentley, J. and Ottmann, T. 1979. Algorithms for Reporting and Counting Geometric Intersections. In IEEE Transactions on Computers, C-28, 9, 643–647 Google ScholarDigital Library
    5. Fekete, J.-D., Bizouarn, É., Cournarie, É., GALAS, T., and Taillefer, F. 1995 TicTacToon: A paperless System for Professional 2D Animation. In Proceedings of ACM SIGGRAPH 95, Computer Graphics Proceedings, Annual Conference Series, ACM, 79–89. Google ScholarDigital Library
    6. Gangnet, M., Hervé, J.-C., Pudet, T, and Van Thong, J.-M. 1989. Incremental Computation of Planar Maps. In Computer Graphics, 23, 4, ACM, 345–354. Google ScholarDigital Library
    7. Gangnet, M., Van Thong, J.-M., and Fekete, J.-D. 1994. Automatic Gap Closing for Freehand Drawing. ACM SIGGRAPH 94 Technical Sketch.Google Scholar
    8. Hobby, J. 1999. Practical Segment Intersection with Finite Precision Output. In Computational Geometry 13, Elsevier, 199–214. Google ScholarDigital Library
    9. Macromedia, Inc. 2005. Macromedia Flash 8: Using Flash. Macromedia, Inc.Google Scholar
    10. Neuhaus M. and Bunke, H. 2004. An Error-tolerant Approximate Matching Algorithm for Attributed Planar Graphs and its Application to Fingerprint Classification. In Proceedings of the 10th International Workshop on Structural and Syntactic Pattern Recognition, Springer-Verlag LNCS 3138, 180–189.Google Scholar
    11. Wiley, K. and Williams, L. 2006. Representation of Interwoven Surfaces in 2 1/2 D Drawing. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems. 65–74. Google ScholarDigital Library
    12. Young, M. and Halvorson, M. 2003. Microsoft Office System Inside Out—2003 Edition. Microsoft Press. Google ScholarDigital Library

ACM Digital Library Publication:

Overview Page: