Integer-Grid Sketch Simplification and Vectorization
dc.contributor.author | Stanko, Tibor | en_US |
dc.contributor.author | Bessmeltsev, Mikhail | en_US |
dc.contributor.author | Bommes, David | en_US |
dc.contributor.author | Bousseau, Adrien | en_US |
dc.contributor.editor | Jacobson, Alec and Huang, Qixing | en_US |
dc.date.accessioned | 2020-07-05T13:26:13Z | |
dc.date.available | 2020-07-05T13:26:13Z | |
dc.date.issued | 2020 | |
dc.description.abstract | A major challenge in line drawing vectorization is segmenting the input bitmap into separate curves. This segmentation is especially problematic for rough sketches, where curves are depicted using multiple overdrawn strokes. Inspired by featurealigned mesh quadrangulation methods in geometry processing, we propose to extract vector curve networks by parametrizing the image with local drawing-aligned integer grids. The regular structure of the grid facilitates the extraction of clean line junctions; due to the grid's discrete nature, nearby strokes are implicitly grouped together. We demonstrate that our method successfully vectorizes both clean and rough line drawings, whereas previous methods focused on only one of those drawing types. | en_US |
dc.description.number | 5 | |
dc.description.sectionheaders | Meshing | |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.volume | 39 | |
dc.identifier.doi | 10.1111/cgf.14075 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.pages | 149-161 | |
dc.identifier.uri | https://doi.org/10.1111/cgf.14075 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14075 | |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.rights | Attribution 4.0 International License | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Computing methodologies | |
dc.subject | Parametric curve and surface models | |
dc.subject | Reconstruction | |
dc.title | Integer-Grid Sketch Simplification and Vectorization | en_US |