{
    "status": "ok",
    "message-type": "work",
    "message-version": "1.0.0",
    "message": {
        "indexed": {
            "date-parts": [
                [
                    2020,
                    4,
                    4
                ]
            ],
            "date-time": "2020-04-04T02:11:27Z",
            "timestamp": 1585966287210
        },
        "reference-count": 32,
        "publisher": "Association for Computing Machinery (ACM)",
        "issue": "4",
        "license": [
            {
                "URL": "http://www.acm.org/publications/policies/copyright_policy#Background",
                "start": {
                    "date-parts": [
                        [
                            2017,
                            7,
                            24
                        ]
                    ],
                    "date-time": "2017-07-24T00:00:00Z",
                    "timestamp": 1500854400000
                },
                "delay-in-days": 378,
                "content-version": "vor"
            }
        ],
        "funder": [
            {
                "DOI": "10.13039/100000001",
                "name": "National Science Foundation",
                "doi-asserted-by": "publisher",
                "award": [
                    "CMMI-11-29917"
                ]
            }
        ],
        "content-domain": {
            "domain": [],
            "crossmark-restriction": false
        },
        "short-container-title": [
            "ACM Trans. Graph."
        ],
        "published-print": {
            "date-parts": [
                [
                    2016,
                    7,
                    11
                ]
            ]
        },
        "DOI": "10.1145/2897824.2925901",
        "type": "journal-article",
        "created": {
            "date-parts": [
                [
                    2016,
                    7,
                    11
                ]
            ],
            "date-time": "2016-07-11T16:04:33Z",
            "timestamp": 1468253073000
        },
        "page": "1-15",
        "source": "Crossref",
        "is-referenced-by-count": 30,
        "title": [
            "Mesh arrangements for solid geometry"
        ],
        "prefix": "10.1145",
        "volume": "35",
        "author": [
            {
                "given": "Qingnan",
                "family": "Zhou",
                "sequence": "first",
                "affiliation": [
                    {
                        "name": "New York University"
                    }
                ]
            },
            {
                "given": "Eitan",
                "family": "Grinspun",
                "sequence": "additional",
                "affiliation": [
                    {
                        "name": "Columbia University"
                    }
                ]
            },
            {
                "given": "Denis",
                "family": "Zorin",
                "sequence": "additional",
                "affiliation": [
                    {
                        "name": "New York University"
                    }
                ]
            },
            {
                "given": "Alec",
                "family": "Jacobson",
                "sequence": "additional",
                "affiliation": [
                    {
                        "name": "Columbia University"
                    }
                ]
            }
        ],
        "member": "320",
        "reference": [
            {
                "key": "e_1_2_2_1_1",
                "DOI": "10.1007/s00371-010-0416-3",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_2_1",
                "unstructured": "Attene M. 2014. Direct repair of self-intersecting meshes. Graphical Models. 10.1016/j.gmod.2014.09.002   Attene M. 2014. Direct repair of self-intersecting meshes. Graphical Models. 10.1016/j.gmod.2014.09.002"
            },
            {
                "key": "e_1_2_2_3_1",
                "unstructured": "Banerjee R. P. and Rossignac J. R. 1996. Topologically exact evaluation of polyhedra defined in CSG with loose primitives. Comput. Graph. Forum.  Banerjee R. P. and Rossignac J. R. 1996. Topologically exact evaluation of polyhedra defined in CSG with loose primitives. Comput. Graph. Forum.",
                "DOI": "10.1111/1467-8659.1540205",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_4_1",
                "unstructured": "Barki H. Guennebaud G. and Foufou S. 2015. Exact robust and efficient regularized booleans on general 3d meshes. Computers and Mathematics with Applications. 10.1016/j.camwa.2015.06.016   Barki H. Guennebaud G. and Foufou S. 2015. Exact robust and efficient regularized booleans on general 3d meshes. Computers and Mathematics with Applications. 10.1016/j.camwa.2015.06.016",
                "DOI": "10.1016/j.camwa.2015.06.016",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_5_1",
                "author": "Bernstein G.",
                "volume-title": "Proc. SGP."
            },
            {
                "key": "e_1_2_2_6_1",
                "unstructured": "Bernstein G. 2013. Cork boolean library. https://github.com/gilbo/cork.  Bernstein G. 2013. Cork boolean library. https://github.com/gilbo/cork."
            },
            {
                "key": "e_1_2_2_7_1",
                "author": "Bieri H.",
                "volume-title": "Proc. IWCGA."
            },
            {
                "key": "e_1_2_2_8_1",
                "unstructured": "Campen M. and Kobbelt L. 2010. Exact and robust (self-) intersections for polygonal meshes. Comput. Graph. Forum.  Campen M. and Kobbelt L. 2010. Exact and robust (self-) intersections for polygonal meshes. Comput. Graph. Forum.",
                "DOI": "10.1111/j.1467-8659.2009.01609.x",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_9_1",
                "unstructured": "Campen M. and Kobbelt L. 2010. Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes. Comput. Graph. Forum.  Campen M. and Kobbelt L. 2010. Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes. Comput. Graph. Forum .",
                "DOI": "10.1111/j.1467-8659.2010.01770.x",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_10_1",
                "unstructured": "Campen M. Attene M. and Kobbelt L. 2012. A practical guide to polygon mesh repairing. Eurographics Tutorial.  Campen M. Attene M. and Kobbelt L. 2012. A practical guide to polygon mesh repairing. Eurographics Tutorial.",
                "DOI": "10.1145/2431211.2431214",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_11_1",
                "author": "CARVE",
                "year": "2014",
                "volume-title": "Carve: An efficient and robust library for boolean operations on polyhedra"
            },
            {
                "key": "e_1_2_2_12_1",
                "unstructured": "CGAL 2015. Cgal Computational Geometry Algorithms Library. http://www.cgal.org.  CGAL 2015. Cgal Computational Geometry Algorithms Library. http://www.cgal.org."
            },
            {
                "key": "e_1_2_2_13_1",
                "author": "Douze M.",
                "year": "2015",
                "volume-title": "Tech. Rep. 01121419"
            },
            {
                "key": "e_1_2_2_14_1",
                "unstructured": "Edelsbrunner H. and M\u00fccke E. P. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph.. 10.1145/77635.77639   Edelsbrunner H. and M\u00fccke E. P. 1990. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. . 10.1145/77635.77639"
            },
            {
                "key": "e_1_2_2_15_1",
                "unstructured": "Fortune S. 1997. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom.  Fortune S. 1997. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom.",
                "DOI": "10.1145/276884.276897",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_16_1",
                "author": "Granados M.",
                "volume-title": "Proc. ESA."
            },
            {
                "key": "e_1_2_2_17_1",
                "unstructured": "Jacobson A. Kavan L. and Sorkine-Hornung O. 2013. Robust inside-outside segmentation using generalized winding numbers. ACM Trans. Graph.. 10.1145/2461912.2461916   Jacobson A. Kavan L. and Sorkine-Hornung O. 2013. Robust inside-outside segmentation using generalized winding numbers. ACM Trans. Graph. . 10.1145/2461912.2461916",
                "DOI": "10.1145/2461912.2461916",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_18_1",
                "unstructured": "Jacobson A. Panozzo D. etal 2016. libigl: A simple C++ geometry processing library. http://libigl.github.io/libigl/.  Jacobson A. Panozzo D. et al. 2016. libigl: A simple C++ geometry processing library. http://libigl.github.io/libigl/.",
                "DOI": "10.1145/3134472.3134497",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_19_1",
                "unstructured": "Mei G. and Tipper J. C. 2013. Simple and robust boolean operations for triangulated surfaces. arXiv preprint arXiv:1308.4434.  Mei G. and Tipper J. C. 2013. Simple and robust boolean operations for triangulated surfaces. arXiv preprint arXiv:1308.4434."
            },
            {
                "key": "e_1_2_2_20_1",
                "unstructured": "Milenkovic V. J. and Nackman L. R. 1990. Finding compact coordinate representations for polygons and polyhedra.  Milenkovic V. J. and Nackman L. R. 1990. Finding compact coordinate representations for polygons and polyhedra.",
                "DOI": "10.1145/98524.98579",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_21_1",
                "unstructured": "Museth K. Breen D. E. Whitaker R. T. and Barr A. H. 2002. Level set surface editing operators. ACM Trans. Graph.. 10.1145/566654.566585   Museth K. Breen D. E. Whitaker R. T. and Barr A. H. 2002. Level set surface editing operators. ACM Trans. Graph. . 10.1145/566654.566585",
                "DOI": "10.1145/566570.566585",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_22_1",
                "DOI": "10.1145/97879.97892",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_23_1",
                "unstructured": "Pavic D. Campen M. and Kobbelt L. 2010. Hybrid Booleans. Comput. Graph. Forum.  Pavic D. Campen M. and Kobbelt L. 2010. Hybrid Booleans. Comput. Graph. Forum.",
                "DOI": "10.1111/j.1467-8659.2009.01545.x",
                "doi-asserted-by": "crossref"
            },
            {
                "key": "e_1_2_2_24_1",
                "DOI": "10.1111/cgf.12181",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_25_1",
                "unstructured": "Sacks E. and Milenkovic V. 2014. Robust cascading of operations on polyhedra. Computer-Aided Design (Tech. Note). 10.1016/j.cad.2013.08.035   Sacks E. and Milenkovic V. 2014. Robust cascading of operations on polyhedra. Computer-Aided Design (Tech. Note). 10.1016/j.cad.2013.08.035"
            },
            {
                "key": "e_1_2_2_26_1",
                "author": "Sugihara K.",
                "volume-title": "Proc. of the IEEE."
            },
            {
                "key": "e_1_2_2_27_1",
                "DOI": "10.1145/37401.37421",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_28_1",
                "DOI": "10.1145/1057432.1057464",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_29_1",
                "unstructured": "Wang C. C. L. 2011. Approximate boolean operations on large polyhedral solids with partial mesh reconstruction. IEEE TVCG. 10.1109/TVCG.2010.106   Wang C. C. L. 2011. Approximate boolean operations on large polyhedral solids with partial mesh reconstruction. IEEE TVCG. 10.1109/TVCG.2010.106"
            },
            {
                "key": "e_1_2_2_30_1",
                "unstructured": "Xu S. and Keyser J. 2013. Fast and robust booleans on polyhedra. Computer-Aided Design. 10.1016/j.cad.2012.10.036   Xu S. and Keyser J. 2013. Fast and robust booleans on polyhedra. Computer-Aided Design. 10.1016/j.cad.2012.10.036"
            },
            {
                "key": "e_1_2_2_31_1",
                "DOI": "10.1007/s00371-011-0571-1",
                "doi-asserted-by": "publisher"
            },
            {
                "key": "e_1_2_2_32_1",
                "unstructured": "Zhou Q. Panetta J. and Zorin D. 2013. Worst-case structural analysis. ACM Trans. Graph.. 10.1145/2461912.2461967   Zhou Q. Panetta J. and Zorin D. 2013. Worst-case structural analysis. ACM Trans. Graph. . 10.1145/2461912.2461967"
            }
        ],
        "container-title": [
            "ACM Transactions on Graphics"
        ],
        "original-title": [],
        "language": "en",
        "link": [
            {
                "URL": "https://dl.acm.org/doi/pdf/10.1145/2897824.2925901",
                "content-type": "application/pdf",
                "content-version": "vor",
                "intended-application": "syndication"
            },
            {
                "URL": "http://dl.acm.org/ft_gateway.cfm?id=2925901&ftid=1755913&dwn=1",
                "content-type": "unspecified",
                "content-version": "vor",
                "intended-application": "similarity-checking"
            }
        ],
        "deposited": {
            "date-parts": [
                [
                    2020,
                    4,
                    4
                ]
            ],
            "date-time": "2020-04-04T01:37:57Z",
            "timestamp": 1585964277000
        },
        "score": 1.0,
        "subtitle": [],
        "short-title": [],
        "issued": {
            "date-parts": [
                [
                    2016,
                    7,
                    11
                ]
            ]
        },
        "references-count": 32,
        "journal-issue": {
            "published-print": {
                "date-parts": [
                    [
                        2016,
                        7,
                        11
                    ]
                ]
            },
            "issue": "4"
        },
        "alternative-id": [
            "10.1145/2897824.2925901"
        ],
        "URL": "http://dx.doi.org/10.1145/2897824.2925901",
        "relation": {
            "cites": []
        },
        "ISSN": [
            "0730-0301",
            "1557-7368"
        ],
        "issn-type": [
            {
                "value": "0730-0301",
                "type": "print"
            },
            {
                "value": "1557-7368",
                "type": "electronic"
            }
        ]
    }
}