Vector graphics complexes

Basic topological modeling, such as the ability to have several faces share a common edge, has been largely absent from vector graphics. We introduce the vector graphics complex (VGC) as a simple data structure to support fundamental topological modeling operations for vector graphics illustrations. The VGC can represent any arbitrary non-manifold topology as an immersion in the plane, unlike planar maps which can only represent embeddings. This allows for the direct representation of incidence relationships between objects and can therefore more faithfully capture the intended semantics of many illustrations, while at the same time keeping the geometric flexibility of stacking-based systems. We describe and implement a set of topological editing operations for the VGC, including glue, unglue, cut, and uncut. Our system maintains a global stacking order for all faces, edges, and vertices without requiring that components of an object reside together on a single layer. This allows for the coordinated editing of shared vertices and edges even for objects that have components distributed across multiple layers. We introduce VGC-specific methods that are tailored towards quickly achieving desired stacking orders for faces, edges, and vertices.

[1]  C. Peng SCALABLE VECTOR GRAPHICS (SVG) , 2000 .

[2]  Andreas Neumann Scalable Vector Graphics (SVG) , 2008, Encyclopedia of GIS.

[3]  Andrea J. van Doorn,et al.  The Structure of Visual Spaces , 2008, Journal of Mathematical Imaging and Vision.

[4]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[5]  John C. Hart,et al.  Snaxels on a plane , 2011, NPAR '11.

[6]  Kurt Mehlhorn,et al.  Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation , 2003, ESA.

[7]  Patrick Baudelaire,et al.  Planar maps: an interaction paradigm for graphic design , 1989, CHI '89.

[8]  PASCAL LIENHARDT,et al.  N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds , 1994, Int. J. Comput. Geom. Appl..

[9]  Lance R. Williams,et al.  Representation of interwoven surfaces in 2 1/2 D drawing , 2006, CHI.

[10]  Abel J. P. Gomes,et al.  Adjacency and incidence framework: a data structure for efficient and fast management of multiresolution meshes , 2003, GRAPHITE '03.

[11]  Stefka Gueorguieva,et al.  Topological Operators for Non-manifold Modeling , 1995 .

[12]  Mike Schuster,et al.  Dynamic planar map illustration , 2007, ACM Trans. Graph..

[13]  Hélio Lopes,et al.  A stratification approach for modeling two-dimensional cell complexes , 2004, Comput. Graph..

[14]  Tom Duff,et al.  Compositing digital images , 1984, SIGGRAPH.

[15]  Leila De Floriani,et al.  Representation of non-manifold objects , 2003, SM '03.

[16]  Frédo Durand,et al.  An invitation to discuss computer depiction , 2002, NPAR '02.

[17]  Jarek Rossignac Structured topological complexes: a feature-based API for non-manifold topologies , 1997, SMA '97.

[18]  J. Mitani,et al.  Apparent layer operations for the manipulation of deformable objects , 2010, ACM Trans. Graph..

[19]  Nancy S. Pollard,et al.  Local layering , 2009, SIGGRAPH 2009.

[20]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[21]  Kevin Weiler,et al.  Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments , 1985, IEEE Computer Graphics and Applications.

[22]  Young Choi,et al.  Boolean set operations on non-manifold boundary representation objects , 1991, Comput. Aided Des..

[23]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

[24]  Donald D. Hoffman,et al.  Visual intelligence: How we create what we see , 1998 .

[25]  Leila De Floriani,et al.  A Dimension-Independent Data Structure for Simplicial Complexes , 2010, IMR.

[26]  Sang Hun Lee,et al.  Partial entity structure: a compact non-manifold boundary representation based on partial topological entities , 2001, SMA '01.

[27]  Walter Nef Beiträge zur Theorie der Polyeder : mit Anwendungen in der Computergraphik , 1978 .

[28]  Markus H. Gross,et al.  Topology-driven vectorization of clean line drawings , 2013, ACM Trans. Graph..

[29]  Frédo Durand,et al.  A visibility algorithm for converting 3D meshes into editable 2D vector graphics , 2009, ACM Trans. Graph..

[30]  Markus H. Gross,et al.  BetweenIT: An Interactive Tool for Tight Inbetweening , 2010, Comput. Graph. Forum.

[31]  Leila De Floriani,et al.  Representation of Non-manifold Objects Through Decomposition into Nearly Manifold Parts , 2003 .

[32]  Kenshi Takayama,et al.  Sketch-based generation and editing of quad meshes , 2013, ACM Trans. Graph..