Article

Dynamic planar map illustration

Authors:

Paul Asente,

Mike Schuster,

Teri PettitAuthors Info & Claims

SIGGRAPH '07: ACM SIGGRAPH 2007 papers

Pages 30 - es

https://doi.org/10.1145/1275808.1276415

Published: 29 July 2007 Publication History

Get Access

Abstract

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.

Supplementary Material

JPG File (pps030.jpg)

Download
22.52 KB

MP4 File (pps030.mp4)

Download
38.74 MB

References

[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.

Digital Library

Google Scholar

[3]

Baudelaire, P. and Gangnet, M. 1989. Planar Maps: An Interaction Paradigm for Graphic Design. In CHI'89 Proceedings, Addison-Wesley, 313--318.

Digital Library

Google Scholar

[4]

Bentley, J. and Ottmann, T. 1979. Algorithms for Reporting and Counting Geometric Intersections. In IEEE Transactions on Computers, C-28, 9, 643--647

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[12]

Young, M. and Halvorson, M. 2003. Microsoft Office System Inside Out---2003 Edition. Microsoft Press.

Digital Library

Google Scholar

Cited By

View all

Dalstein BFoley J(2019)Topological Modeling for Vector GraphicsIEEE Computer Graphics and Applications10.1109/MCG.2019.289127739:3(86-95)Online publication date: 1-May-2019
https://doi.org/10.1109/MCG.2019.2891277
Eisemann EParis SDurand FFunkhouser T(2009)A visibility algorithm for converting 3D meshes into editable 2D vector graphicsACM SIGGRAPH 2009 papers10.1145/1576246.1531389(1-8)Online publication date: 27-Jul-2009
https://dl.acm.org/doi/10.1145/1576246.1531389
Eisemann EParis SDurand F(2009)A visibility algorithm for converting 3D meshes into editable 2D vector graphicsACM Transactions on Graphics (TOG)10.1145/1531326.153138928:3(1-8)Online publication date: 27-Jul-2009
https://dl.acm.org/doi/10.1145/1531326.1531389

Index Terms

Dynamic planar map illustration

Recommendations

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 ...
The Size of the Largest Components in Random Planar Maps

Bender, Richmond, and Wormald showed that in almost all planar 3-connected triangulations (or dually, 3-connected cubic maps) with n edges, the largest 4-connected triangulation (or dually, the largest cyclically 4-edge-connected cubic component) has ...
Dynamic coloring and list dynamic coloring of planar graphs

A dynamic coloring of a graph G is a proper coloring of the vertex set V(G) such that for each vertex of degree at least 2, its neighbors receive at least two distinct colors. The dynamic chromatic number@g"d(G) of a graph G is the least number k such ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGGRAPH '07: ACM SIGGRAPH 2007 papers

August 2007

1019 pages

ISBN:9781450378369

DOI:10.1145/1275808

Conference Chair:
Marc Levoy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGGRAPH07

Sponsor:

SIGGRAPH

SIGGRAPH07: Special Interest Group on Computer Graphics and Interactive Techniques Conference

August 5 - 9, 2007

California, San Diego

Acceptance Rates

SIGGRAPH '07 Paper Acceptance Rate 108 of 455 submissions, 24%;

Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
1,354
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dalstein BFoley J(2019)Topological Modeling for Vector GraphicsIEEE Computer Graphics and Applications10.1109/MCG.2019.289127739:3(86-95)Online publication date: 1-May-2019
https://doi.org/10.1109/MCG.2019.2891277
Eisemann EParis SDurand FFunkhouser T(2009)A visibility algorithm for converting 3D meshes into editable 2D vector graphicsACM SIGGRAPH 2009 papers10.1145/1576246.1531389(1-8)Online publication date: 27-Jul-2009
https://dl.acm.org/doi/10.1145/1576246.1531389
Eisemann EParis SDurand F(2009)A visibility algorithm for converting 3D meshes into editable 2D vector graphicsACM Transactions on Graphics (TOG)10.1145/1531326.153138928:3(1-8)Online publication date: 27-Jul-2009
https://dl.acm.org/doi/10.1145/1531326.1531389

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Dynamic planar map illustration

The Size of the Largest Components in Random Planar Maps

Dynamic coloring and list dynamic coloring of planar graphs