{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:58:56Z","timestamp":1726034336336},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030139919"},{"type":"electronic","value":"9783030139926"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-13992-6_20","type":"book-chapter","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T18:09:52Z","timestamp":1562004592000},"page":"365-383","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exact Fast Parallel Intersection of Large 3-D Triangular Meshes"],"prefix":"10.1007","author":[{"given":"Salles Viana Gomes","family":"de Magalh\u00e3es","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Randolph Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus Vin\u00edcius Alvim","family":"Andrade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"issue":"7","key":"20_CR1","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/0010-4485(89)90125-5","volume":"21","author":"V Akman","year":"1989","unstructured":"V. Akman, W.R. Franklin, M. Kankanhalli, C. Narayanaswami, Geometric computing and the uniform grid data technique. Comput. Aided Des. 21(7), 410\u2013420 (1989)","journal-title":"Comput. Aided Des."},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2811256","volume":"2","author":"Alberto Belussi","year":"2016","unstructured":"A. Belussi, S. Migliorini, M. Negri, G. Pelagatti, Snap rounding with restore: an algorithm for producing robust geometric datasets. ACM Trans. Spatial Algoritm. Syst. 2(1), 1:1\u20131:36 (2016)","journal-title":"ACM Transactions on Spatial Algorithms and Systems"},{"issue":"5","key":"20_CR3","first-page":"1269","volume":"28","author":"G Bernstein","year":"2009","unstructured":"G. Bernstein, D. Fussell, Fast, exact, linear booleans. Eurographics Symp. Geom. Process. 28(5), 1269\u20131278 (2009)","journal-title":"Eurographics Symp. Geom. Process."},{"key":"20_CR4","unstructured":"Cgal, Computational Geometry Algorithms Library. https:\/\/www.cgal.org . Retrieved Sept 2018"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1111\/1467-8659.00236","volume":"17","author":"P Cignoni","year":"1998","unstructured":"P. Cignoni, C. Rocchini, R. Scopigno, Metro: measuring error on simplified surfaces. Comput. Graphics Forum 17(2), 167\u2013174 (1998)","journal-title":"Comput. Graphics Forum"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.comgeo.2006.03.002","volume":"36","author":"M Berg de","year":"2007","unstructured":"M. de Berg, D. Halperin, M. Overmars, An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3), 159\u2013165 (2007)","journal-title":"Comput. Geom."},{"key":"20_CR7","unstructured":"S.V.G. de Magalh\u00e3es, Exact and parallel intersection of 3D triangular meshes, Ph.D. thesis, Rensselaer Polytechnic Institute, 2017"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"S.V.G. de Magalh\u00e3es, W.R. Franklin, M.V.A. Andrade, W. Li, An efficient algorithm for computing the exact overlay of triangulations, in 25th Fall Workshop on Computational Geometry, U. Buffalo, New York, USA, 23\u201324 Oct 2015 (2015). Extended abstract","DOI":"10.1145\/2855680.2855840"},{"key":"20_CR9","unstructured":"M. Douze, J.-S. Franco, B. Raffin, QuickCSG: arbitrary and faster boolean combinations of n solids, Ph.D. thesis, Inria-Research Centre, Grenoble\u2013Rh\u00f4ne-Alpes, France, 2015"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H Edelsbrunner","year":"1990","unstructured":"H. Edelsbrunner, E.P. M\u00fccke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM TOG 9(1), 66\u2013104 (1990)","journal-title":"ACM TOG"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.cad.2012.11.004","volume":"45","author":"F Feito","year":"2013","unstructured":"F. Feito, C. Ogayar, R. Segura, M. Rivero, Fast and accurate evaluation of regularized boolean operations on triangulated solids. Comput. Aided Des. 45(3), 705\u2013716 (2013)","journal-title":"Comput. Aided Des."},{"key":"20_CR12","unstructured":"W.R. Franklin, Efficient polyhedron intersection and union, in Proceedings of Graphics Interface, pp. 73\u201380, Toronto (1982)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"W.R. Franklin, Adaptive grids for geometric operations. Cartographica 21(2\u20133), 161\u2013167, Summer \u2013 Autumn (1984). Monograph 32\u201333","DOI":"10.3138\/Q722-7681-3K17-JR08"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"W.R. Franklin, Polygon properties calculated from the vertex neighborhoods, in Proceedings of 3rd Annual ACM Symposium on Computational Geometry, pp. 110\u2013118 (1987)","DOI":"10.1145\/41958.41969"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"W.R. Franklin, S.V.G. Magalh\u00e3es, Parallel intersection detection in massive sets of cubes, in Proceedings of BigSpatial\u2019 17: 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data, Los Angeles Area, CA, USA, 7\u201310 Nov 2017 (2017)","DOI":"10.1145\/3150919.3150921"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-83492-9_25","volume-title":"New Trends in Computer Graphics","author":"Wm. R. Franklin","year":"1988","unstructured":"W.R. Franklin, N. Chandrasekhar, M. Kankanhalli, M. Seshan, V. Akman, Efficiency of uniform grids for intersection detection on serial and parallel machines, in New Trends in Computer Graphics (Proc. Computer Graphics International\u201988), ed. by N. Magnenat-Thalmann, D. Thalmann, pp. 288\u2013297 (Springer, Berlin, 1988)"},{"key":"20_CR17","unstructured":"W.R. Franklin, C. Narayanaswami, M. Kankanhalli, D. Sun, M.-C. Zhou, P. Y. Wu, Uniform grids: a technique for intersection detection on serial and parallel machines, in Proceedings of Auto Carto 9: Ninth International Symposium on Computer-Assisted Cartography, pp. 100\u2013109, Baltimore, Maryland, 2\u20137 April 1989 (1989)"},{"key":"20_CR18","volume-title":"Mesh Generation: Application to Finite Elements, Second Edition","author":"PJ Frey","year":"2010","unstructured":"P.J. Frey, P. George, Mesh Generation: Application to Finite Elements, Second Edition (ISTE Ltd.\/Wiley, London\/Hoboken, 2010)"},{"issue":"11","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1002\/nme.2579","volume":"79","author":"C Geuzaine","year":"2009","unstructured":"C. Geuzaine, J.-F. Remacle, Gmsh: a 3-d finite element mesh generator with built-in pre-and post-processing facilities. Int. J. Numer. Methods Eng. 79(11), 1309\u20131331 (2009)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"20_CR20","unstructured":"S. Ghemawat, P. Menage, TCMalloc: thread-caching malloc (15 Nov 2015), http:\/\/goog-perftools.sourceforge.net\/doc\/tcmalloc.html . Retrieved on 13 Nov 2016"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.comgeo.2006.11.009","volume":"38","author":"P Hachenberger","year":"2007","unstructured":"P. Hachenberger, L. Kettner, K. Mehlhorn, Boolean operations on 3d selective nef complexes: data structure, algorithms, optimized implementation and experiments. Comupt. Geom. 38(1), 64\u201399 (2007)","journal-title":"Comupt. Geom."},{"key":"20_CR22","unstructured":"D. Hedin, W.R. Franklin, NearptD: a parallel implementation of exact nearest neighbor search using a uniform grid, in Canadian Conference on Computational Geometry, Vancouver Canada (Aug. 2016)"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.comgeo.2012.02.011","volume":"46","author":"J Hershberger","year":"2013","unstructured":"J. Hershberger, Stable snap rounding. Comput. Geom. 46(4), 403\u2013416 (2013)","journal-title":"Comput. Geom."},{"issue":"4","key":"20_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0925-7721(99)00021-8","volume":"13","author":"JD Hobby","year":"1999","unstructured":"J.D. Hobby, Practical segment intersection with finite precision output. Comput. Geom. 13(4), 199\u2013214 (1999)","journal-title":"Comput. Geom."},{"key":"20_CR25","unstructured":"A. Jacobson, D. Panozzo, et al., libigl: A Simple C++ Geometry Processing Library (2016), http:\/\/libigl.github.io\/libigl\/ . Retrieved on 18 Oct 2017"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1995.1076","volume":"27","author":"M Kankanhalli","year":"1995","unstructured":"M. Kankanhalli, W.R. Franklin, Area and perimeter computation of the union of a set of iso-rectangles in parallel. J. Parallel Distrib. Comput. 27(2), 107\u2013117 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.comgeo.2007.06.003","volume":"40","author":"L Kettner","year":"2008","unstructured":"L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, C. Yap, Classroom examples of robustness problems in geometric computations. Comput. Geom. Theory Appl. 40(1), 61\u201378 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"key":"20_CR28","unstructured":"C. Leconte, H. Barki, F. Dupont, Exact and Efficient Booleans for Polyhedra. Technical Report RR-LIRIS-2010-018, LIRIS UMR 5205 CNRS\/INSA de Lyon\/Universit\u00e9 Claude Bernard Lyon 1\/Universit\u00e9 Lumi\u00e8re Lyon 2\/\u00c9cole Centrale de Lyon (Oct. 2010). Retrieved on 19 Oct 2017"},{"key":"20_CR29","unstructured":"C. Li, Exact geometric computation: theory and applications, Ph.D. thesis, Department of Computer Science, Courant Institute - New York University, January 2001"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"S.V.G. Magalh\u00e3es, M.V.A. Andrade, W.R. Franklin, W. Li, Fast exact parallel map overlay using a two-level uniform grid, in 4th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data (BigSpatial), Bellevue WA USA, 3 Nov 2015","DOI":"10.1145\/2835185.2835188"},{"key":"20_CR31","unstructured":"S.V.G. Magalh\u00e3es, M.V.A. Andrade, W.R. Franklin, W. Li, PinMesh \u2013 fast and exact 3D point location queries using a uniform grid. Comput. Graph. J. 58, 1\u201311 (2016). Special issue on Shape Modeling International 2016 (online 17 May). Awarded a reproducibility stamp, http:\/\/www.reproducibilitystamp.com\/"},{"key":"20_CR32","unstructured":"S.V.G. Magalh\u00e3es, M.V.A. Andrade, W.R. Franklin, W. Li, M.G. Gruppi, Exact intersection of 3D geometric models, in Geoinfo 2016, XVII Brazilian Symposium on GeoInformatics, Campos do Jord\u00e3o, SP, Brazil (Nov. 2016)"},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0146-664X(82)90104-6","volume":"19","author":"DJ Meagher","year":"1982","unstructured":"D.J. Meagher, Geometric modelling using octree encoding. Comput. Graphics Image Process. 19, 129\u2013147 (1982)","journal-title":"Comput. Graphics Image Process."},{"key":"20_CR34","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11786986_27","volume-title":"Automata, Languages and Programming","author":"Kurt Mehlhorn","year":"2006","unstructured":"K. Mehlhorn, R. Osbild, M. Sagraloff, Reliable and efficient computational geometry via controlled perturbation, in ICALP (1), ed. by M. Bugliesi, B. Preneel, V. Sassone, I. Wegener. Lecture Notes in Computer Science, vol. 4051, pp. 299\u2013310 (Springer, Berlin, 2006)"},{"key":"20_CR35","unstructured":"G. Mei, J.C. Tipper, Simple and robust boolean operations for triangulated surfaces. CoRR, abs\/1308.4434 (2013)"},{"key":"20_CR36","unstructured":"Oslandia, IGN, SFCGAL, 2017, http:\/\/www.sfcgal.org\/ . Retrieved on 19 Oct 2017"},{"issue":"1","key":"20_CR37","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1111\/j.1467-8659.2009.01545.x","volume":"29","author":"D Pavi\u0107","year":"2010","unstructured":"D. Pavi\u0107, M. Campen, L. Kobbelt, Hybrid booleans. Comput. Graph. Forum 29(1), 75\u201387 (2010)","journal-title":"Comput. Graph. Forum"},{"issue":"4","key":"20_CR38","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.scico.2010.09.003","volume":"76","author":"S Pion","year":"2011","unstructured":"S. Pion, A. Fabri, A generic lazy evaluation scheme for exact geometric computations. Sci. Comput. Program. 76(4), 307\u2013323 (2011)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"20_CR39","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"JR Shewchuk","year":"1997","unstructured":"J.R. Shewchuk, Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discret. Comput. Geom. 18(3), 305\u2013363 (1997)","journal-title":"Discret. Comput. Geom."},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"C.K. Yap, Symbolic treatment of geometric degeneracies, in System Modelling and Optimization: Proceedings of 13th IFIP Conference, ed. by M. Iri, K. Yajima, pp. 348\u2013358 (Springer, Berlin, 1988)","DOI":"10.1007\/BFb0042803"},{"key":"20_CR41","doi-asserted-by":"crossref","unstructured":"J. Yongbin, W. Liguan, B. Lin, C. Jianhong, Boolean operations on polygonal meshes using obb trees, in ESIAT 2009, vol. 1, pp. 619\u2013622 (IEEE, Piscataway, 2009)","DOI":"10.1109\/ESIAT.2009.128"},{"issue":"4","key":"20_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2897824.2925901","volume":"35","author":"Qingnan Zhou","year":"2016","unstructured":"Q. Zhou, E. Grinspun, D. Zorin, A. Jacobson, Mesh arrangements for solid geometry. ACM Trans. Graph. 35(4), 39:1\u201339:15 (2016)","journal-title":"ACM Transactions on Graphics"}],"container-title":["Lecture Notes in Computational Science and Engineering","27th International Meshing Roundtable"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13992-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T16:18:57Z","timestamp":1663863537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13992-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030139919","9783030139926"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13992-6_20","relation":{},"ISSN":["1439-7358","2197-7100"],"issn-type":[{"type":"print","value":"1439-7358"},{"type":"electronic","value":"2197-7100"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Meshing Roundtable","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Albuquerque,, NM","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"imr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/imr.sandia.gov\/27imr\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}