A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics
Elmar Eisemann, Sylvain Paris, Frédo Durand
In ACM Transactions on Graphics, 28(3), July 2009.
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.
Keyword(s): NPR, geometry processing, vector graphics, visibility
@article{Eisemann:2009:AVA,
author = {Elmar Eisemann and Sylvain Paris and Frédo Durand},
title = {A Visibility Algorithm for Converting 3D Meshes into Editable 2D Vector Graphics},
journal = {ACM Transactions on Graphics},
volume = {28},
number = {3},
pages = {83:1--83:8},
month = jul,
year = {2009},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."