ACM Home Page
Please provide us with feedback. Feedback
A visibility algorithm for converting 3D meshes into editable 2D vector graphics
Full text PdfPdf (22.82 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Vector graphics and point distributions table of contents
Article No. 83  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Elmar Eisemann  Saarland University / MPI
Sylvain Paris  Adobe Systems, Inc.
Frédo Durand  MIT CSAIL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 77,   Downloads (12 Months): 232,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531389
What is a DOI?

APPENDICES and SUPPLEMENTS
Content: - Main paper - Short paper on details of the cut implementation - Thumbnail - Video


ABSTRACT

Artists often need to import and embellish 3D models coming from CAD-CAM into 2D vector graphics software to produce, e.g., brochures or manuals. Current automatic solutions tend to result, at best, in a 2D triangle soup and artists often have to trace over 3D renderings. We describe a method to convert 3D models into 2D layered vector illustrations that respect visibility and facilitate further editing. Our core contribution is a visibility method that can partition a mesh into large components that can be layered according to visibility. Because self-occluding objects and objects forming occlusion cycles cannot be represented by layers without being cut, we introduce a new cut algorithm that uses a graph representation of the mesh and curvature-aware geodesic distances.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
4
5
 
6
Eisemann, E., Winnemöller, H., Hart, J. C., and Salesin, D. 2008. Stylized vector art from 3d models with region support. Computer Graphics Forum 27, 4. Proceedings of the Eurographics Symposium on Rendering.
 
7
Grabli, S., Turquin, E., Durand, F., and Sillion, F. 2004. Programmable style for npr line drawing. In Rendering Techniques (Proceedings of the Eurographics Symposium on Rendering), ACM Press, 33--44.
 
8
Isenberg, T., Carpendale, M. S. T., and Sousa, M. C. 2005. Breaking the pixel barrier. In Proceedings of the Eurographics Workshop on Computational Aesthetics in Graphics, Visualization and Imaging.
9
10
 
11
Kann, V. 1992. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm.
12
13
 
14
15
 
16
17
 
18
Press, W., Teukolsky, S., Vetterling, W., and Flannery, B. 1992. Numerical Recipes in C. Cambridge University Press, Cambridge, UK.
 
19
Ryu, D. 2001. Visibility Layer Decomposition. Senior thesis, Harvard University.
 
20
21
 
22
23
24
 
25
VectorTuts.com, 2008. Rendering a 2d spark plug diagram from 3d components in illustrator. http://vectortuts.com/tutroials/illustration/.
26

Collaborative Colleagues:
Elmar Eisemann: colleagues
Sylvain Paris: colleagues
Frédo Durand: colleagues