English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics

MPS-Authors

Eisemann,  Elmar
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eisemann, E., Paris, S., & Durand, F. (2009). A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics. ACM Transactions on Graphics (Proc. of Siggraph), 28(3): 83, pp. 83,1-83,8.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1986-6
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.