{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:47:50Z","timestamp":1775054870149,"version":"3.50.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2014,11,19]],"date-time":"2014-11-19T00:00:00Z","timestamp":1416355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["INST"],"award-info":[{"award-number":["INST"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2014,11,19]]},"abstract":"<jats:p>\n            We present a massively parallel vector graphics rendering pipeline that is divided into two components. The preprocessing component builds a novel adaptive acceleration data structure, the\n            <jats:italic>shortcut tree<\/jats:italic>\n            . Tree construction is efficient and parallel at the segment level, enabling dynamic vector graphics. The tree allows efficient random access to the color of individual samples, so the graphics can be warped for special effects. The rendering component processes all samples and pixels in parallel. It was optimized for wide antialiasing filters and a large number of samples per pixel to generate sharp, noise-free images. Our\n            <jats:italic>sample scheduler<\/jats:italic>\n            allows pixels with overlapping antialiasing filters to share samples. It groups together samples that can be computed with the same vector operations using little memory or bandwidth. The pipeline is feature-rich, supporting multiple layers of filled paths, each defined by curved outlines (with linear, rational quadratic, and integral cubic B\u00e9zier segments), clipped against other paths, and painted with semi-transparent colors, gradients, or textures. We demonstrate renderings of complex vector graphics in state-of-the-art quality and performance. Finally, we provide full source-code for our implementation as well as the input data used in the paper.\n          <\/jats:p>","DOI":"10.1145\/2661229.2661274","type":"journal-article","created":{"date-parts":[[2014,11,18]],"date-time":"2014-11-18T14:21:03Z","timestamp":1416320463000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Massively-parallel vector graphics"],"prefix":"10.1145","volume":"33","author":[{"given":"Francisco","family":"Ganacim","sequence":"first","affiliation":[{"name":"IMPA --- Instituto Nacional de Matem\u00e1tica Pura e Aplicada"}]},{"given":"Rodolfo S.","family":"Lima","sequence":"additional","affiliation":[{"name":"IMPA --- Instituto Nacional de Matem\u00e1tica Pura e Aplicada"}]},{"given":"Luiz Henrique","family":"de Figueiredo","sequence":"additional","affiliation":[{"name":"IMPA --- Instituto Nacional de Matem\u00e1tica Pura e Aplicada"}]},{"given":"Diego","family":"Nehab","sequence":"additional","affiliation":[{"name":"IMPA --- Instituto Nacional de Matem\u00e1tica Pura e Aplicada"}]}],"member":"320","published-online":{"date-parts":[[2014,11,19]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531392"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1889\/1.1832941"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2005.134"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/965139.807360"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/964965.808586"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Catmull E. and Rom R. 1974. A class of local interpolating splines. In R. Barnhill and R. Riesenfeld editors Computer Aided Geometric Design Academic Press 317--326.  Catmull E. and Rom R. 1974. A class of local interpolating splines. In R. Barnhill and R. Riesenfeld editors Computer Aided Geometric Design Academic Press 317--326.","DOI":"10.1016\/B978-0-12-079050-0.50020-5"},{"key":"e_1_2_2_7_1","unstructured":"Duff T. 1989. Polygon scan conversion by exact convolution. In J. Andr\u00e9 and R. D. Hersch editors Raster Imaging and Digital Typography Cambridge University Press 154--168.  Duff T. 1989. Polygon scan conversion by exact convolution. In J. Andr\u00e9 and R. D. Hersch editors Raster Imaging and Digital Typography Cambridge University Press 154--168."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024200"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344899"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234540"},{"key":"e_1_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Haines E. 1994. Point in polygon strategies. In P. S. Heckbert editor Graphics Gems IV. Morgan Kaufmann.   Haines E. 1994. Point in polygon strategies. In P. S. Heckbert editor Graphics Gems IV . Morgan Kaufmann.","DOI":"10.1016\/B978-0-12-336156-1.50013-6"},{"key":"e_1_2_2_12_1","unstructured":"Kerr K. 2009. Introducing Direct2D. MSDN Magazine.  Kerr K. 2009. Introducing Direct2D. MSDN Magazine."},{"key":"e_1_2_2_13_1","unstructured":"Kilgard M. 1997. A simple OpenGL-based API for texture mapped text. Silicon Graphics. ftp:\/\/ftp.sgi.com\/opengl\/contrib\/mjk\/tips\/TexFont\/TexFont.html.  Kilgard M. 1997. A simple OpenGL-based API for texture mapped text. Silicon Graphics. ftp:\/\/ftp.sgi.com\/opengl\/contrib\/mjk\/tips\/TexFont\/TexFont.html."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366191"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179849.1179997"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141926"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/2151237X.2005.10129189"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073303"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01887.x"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Manson J. and Schaefer S. 2013. Analytic rasterization of curves with polynomial filters. Computer Graphics Forum (Proceedings of Eurographics) 32(2pt4):499--507.  Manson J. and Schaefer S. 2013. Analytic rasterization of curves with polynomial filters. Computer Graphics Forum (Proceedings of Eurographics) 32(2pt4):499--507.","DOI":"10.1111\/cgf.12070"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218499"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/378456.378514"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409088"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2636719"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024210"},{"key":"e_1_2_2_26_1","unstructured":"Neider J. Davis T. and Woo M. 1993. OpenGL Programming Guide Release 1. Addison Wesley. \"Drawing Filled Concave Polygons Using the Stencil Buffer\".  Neider J. Davis T. and Woo M. 1993. OpenGL Programming Guide Release 1 . Addison Wesley. \"Drawing Filled Concave Polygons Using the Stencil Buffer\"."},{"key":"e_1_2_2_27_1","unstructured":"NV_path_rendering. 2011. OpenGL extension specification for NV_path_rendering. NVIDIA Corporation.  NV_path_rendering. 2011. OpenGL extension specification for NV_path_rendering . NVIDIA Corporation."},{"key":"e_1_2_2_28_1","unstructured":"OpenVG. 2008. OpenVG Specification v. 1.1. Khronos Group.  OpenVG. 2008. OpenVG Specification v. 1.1 . Khronos Group."},{"key":"e_1_2_2_29_1","unstructured":"OpenXPS. 2009. Open XML Paper Specification. Ecma International first edition. ECMA-388.  OpenXPS. 2009. Open XML Paper Specification . Ecma International first edition. ECMA-388."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360691"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330511.1330514"},{"key":"e_1_2_2_32_1","unstructured":"PDF. 2006. Adobe Portable Document Format v. 1.7. Adobe Systems Incorporated sixth edition.  PDF. 2006. Adobe Portable Document Format v. 1.7 . Adobe Systems Incorporated sixth edition."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/964965.808606"},{"key":"e_1_2_2_34_1","unstructured":"PostScript. 1999. PostScript Language Reference. Adobe Systems Incorporated third edition.   PostScript. 1999. PostScript Language Reference . Adobe Systems Incorporated third edition."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111411.1111433"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1342250.1342281"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383533.2383570"},{"key":"e_1_2_2_38_1","series-title":"NATO ASI Series","volume-title":"Theoretical Foundations of Computer Graphics and CAD","author":"Ramshaw L."},{"key":"e_1_2_2_39_1","unstructured":"Ray N. Cavin X. and L\u00e9vy B. 2005. Vector texture maps on the GPU. Technical Report ALICE-TR-05-003 INRIA.  Ray N. Cavin X. and L\u00e9vy B. 2005. Vector texture maps on the GPU. Technical Report ALICE-TR-05-003 INRIA."},{"issue":"1","key":"e_1_2_2_40_1","first-page":"50","article-title":"Higher quality 2D text rendering","volume":"2","author":"Rougier N. P.","year":"2013","journal-title":"Journal of Computer Graphics Techniques"},{"key":"e_1_2_2_41_1","unstructured":"Salmon G. 1852. A Treatise on the Higher Order Plane Curves. Hodges & Smith.  Salmon G. 1852. A Treatise on the Higher Order Plane Curves . Hodges & Smith."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1058129.1058139"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882301"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601187"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185570"},{"key":"e_1_2_2_46_1","unstructured":"SVG. 2011. Scalable Vector Graphics v. 1.1. W3C second edition.  SVG. 2011. Scalable Vector Graphics v. 1.1 . W3C second edition."},{"key":"e_1_2_2_47_1","unstructured":"SWF. 2012. SWF File Format Specification v. 19. Adobe Systems Incorporated.  SWF. 2012. SWF File Format Specification v. 19 . Adobe Systems Incorporated."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.75515"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/129902.129906"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/965161.806813"},{"key":"e_1_2_2_51_1","unstructured":"Warnock J. 1969. A hidden surface algorithm for computer generated halftone pictures. PhD thesis University of Utah.   Warnock J. 1969. A hidden surface algorithm for computer generated halftone pictures . PhD thesis University of Utah."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/965145.801297"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465611.1465619"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661229.2661274","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2661229.2661274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:05Z","timestamp":1750227185000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2661229.2661274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,19]]},"references-count":53,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11,19]]}},"alternative-id":["10.1145\/2661229.2661274"],"URL":"https:\/\/doi.org\/10.1145\/2661229.2661274","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,19]]},"assertion":[{"value":"2014-11-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}