{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:48:45Z","timestamp":1742957325654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866525"},{"type":"electronic","value":"9783030866532"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86653-2_2","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:45:47Z","timestamp":1631223947000},"page":"18-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Polytope Overlapping Detection"],"prefix":"10.1007","author":[{"given":"Miroslav S.","family":"Petrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todor D.","family":"Todorov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"issue":"11","key":"2_CR1","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1090\/S0002-9947-06-03833-5","volume":"358","author":"R Aharoni","year":"2006","unstructured":"Aharoni, R., Berger, E.: The intersection of a matroid and a simplicial complex. Trans. Amer. Math. Soc. 358(11), 4895\u20134917 (2006)","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bastrakov, S.I., Churkin, A.V., Yu, N.: Zolotykh, Accelerating Fourier-Motzkin elimination using bit pattern trees Optimization Methods & Software 2020\u201301-14. https:\/\/doi.org\/10.1080\/10556788.2020.1712600","DOI":"10.1080\/10556788.2020.1712600"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Fej\u00e9r monotonicity and fixed point iterations. In: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics (Ouvrages de math\u00e9matiques de la SMC). Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9467-7_5"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002110050475","volume":"85","author":"J Bey","year":"1998","unstructured":"Bey, J.: Simplicial grid refinement, on Freudenthal\u2019s algorithm and the optimal number of congruence classes. Numer. Math. 85(1), 1\u201329 (1998)","journal-title":"Numer. Math."},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10492-007-0013-6","volume":"52","author":"J Brandts","year":"2007","unstructured":"Brandts, J., Korotov, S., K\u0159\u00ed\u017eek, M.: Simplicial finite elements in higher dimensions. Appl. Math. 52(3), 251\u2013265 (2007)","journal-title":"Appl. Math."},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0010-4485(97)00082-1","volume":"30","author":"P Cignonit","year":"1998","unstructured":"Cignonit, P., Montanit, C., Scopigno, R.: DeWall: a fast divide and conquer Delaunay triangulation algorithm in $$E^d$$. Comput. Aided Des. 30(5), 333\u2013341 (1998)","journal-title":"Comput. Aided Des."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Descantes, Y., Tricoire, F., Richard, P.: Classical contact detection algorithms for 3D DEM simulations: drawbacks and solutions. Comput. Geotech. 114, 103134 (2019)","DOI":"10.1016\/j.compgeo.2019.103134"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"David, A., Edwards, K., Ond\u0159ej, F.K., Spurn\u00fd, J.: A note on intersections of simplices. Bull. Soc. Math. France 139.1, 89\u201395 (2011)","DOI":"10.24033\/bsmf.2601"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10543-018-0737-6","volume":"59","author":"J Haddock","year":"2019","unstructured":"Haddock, J., Needell, D.: On Motzkin\u2019s method for inconsistent linear systems. Bit Numer. Math. 59, 387\u2013401 (2019)","journal-title":"Bit Numer. Math."},{"key":"2_CR10","unstructured":"Jing, R.-J., Maza, M.M., Talaashrafi, D.: Complexity estimates for Fourier-Motzkin elimination. CoRR, abs\/1811.01510 (2018)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/BFb0024686","volume-title":"Euro-Par\u201996 Parallel Processing","author":"CW Ke\u00dfler","year":"1996","unstructured":"Ke\u00dfler, C.W.: Parallel fourier-motzkin elimination. In: Boug\u00e9, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1124, pp. 66\u201371. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0024686"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Lee, J.H., Amit, J., Eva, M.: Sevick-Muraca Fast intersections on nested tetrahedrons (FINT): an algorithm for adaptive finite element based distributed parameter estimation. J. Comput. Phys. 227(11), 5778\u20135798 (2008)","DOI":"10.1016\/j.jcp.2008.02.008"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s11075-014-9892-2","volume":"69","author":"Y Lei","year":"2015","unstructured":"Lei, Y.: The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense. Numer. Algorithms 69(1), 227\u2013251 (2015)","journal-title":"Numer. Algorithms"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Khachiyan, L.: Fourier-motzkin elimination method. In: Christodoulos, A.F., Panos, M.P. (eds) Encyclopedia of Optimization. Second Edition, pp. 1074\u20131077. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0_187"},{"key":"2_CR15","unstructured":"Lira, W.M.: Luiz cristovao gomes coelho. In: Multiple Intersections of Finite-Element Surface Meshes. IMR, pp. 355\u2013363. Luiz Fernando Martha (2002)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/BF02591886","volume":"30","author":"J Mandel","year":"1984","unstructured":"Mandel, J.: Convergence of the cyclical relaxation method for linear inequalities. Math. Programm. 30, 218\u2013228 (1984)","journal-title":"Math. Programm."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Montanari, M., Petrinic, N., Barbieri, E.: Improving the GJK algorithm for faster and more reliable distance queries between convex objects. ACM Trans. Graph. 36(3), 30:1\u201330:17 (2017)","DOI":"10.1145\/3083724"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Petrov, M.S., Todorov, T.D.: Properties of the multidimensional finite elements. Appl. Math. Comput. 391, 125695 (2021)","DOI":"10.1016\/j.amc.2020.125695"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.apnum.2018.11.006","volume":"137","author":"MS Petrov","year":"2019","unstructured":"Petrov, M.S., Todorov, T.D.: Refinement strategies related to cubic tetrahedral meshes. Appl. Numer. Math. 137, 169\u2013183 (2019)","journal-title":"Appl. Numer. Math."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s11075-017-0454-2","volume":"79","author":"MS Petrov","year":"2018","unstructured":"Petrov, M.S., Todorov, T.D.: Stable subdivision of 4D polytopes. Numer. Algorithms 79(2), 633\u2013656 (2018)","journal-title":"Numer. Algorithms"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/S0377-2217(97)00178-1","volume":"107","author":"M\u00c7 Pinar","year":"1998","unstructured":"Pinar, M.\u00c7.: Newton\u2019s method for linear inequality systems. Eur. J. Oper. Res. 107, 710\u2013719 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0041-5553(64)90079-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Gradient methods for solving equations and inequalities. USSR Comput. Math. Math. Phys. 4(6), 17\u201332 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13, 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"2_CR24","first-page":"1307","volume":"35","author":"I \u0160ime\u010dek","year":"2016","unstructured":"\u0160ime\u010dek, I., Fritsch, R., Langr, D., L\u00f3rencz, R.: Parallel solver of large systems of linear inequalities using fourier-motzkin elimination. Comput. Inform. 35, 1307\u20131337 (2016)","journal-title":"Comput. Inform."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Talman, D.: intersection theorems on the unit simplex and the simplotope. In: Gilles, R.P., Ruys, P.H.M. (eds) Imperfections and Behavior in Economic Organizations. Theory and Decision Library (Series C: Game Theory, Mathematical Programming and Operations Research), vol. 11, pp. 257\u2013278. Springer, Dordrecht (1994)","DOI":"10.1007\/978-94-011-1370-0_11"},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0377-2217(82)90071-6","volume":"9","author":"J Telgen","year":"1982","unstructured":"Telgen, J.: On relaxation methods for systems of linear inequalities. Eur. J. Oper. Res. 9(2), 184\u2013189 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s40306-015-0168-2","volume":"41","author":"ND Yen","year":"2016","unstructured":"Yen, N.D.: An introduction to vector variational inequalities and some new results. Acta Math. Vietnam 41, 505\u2013529 (2016)","journal-title":"Acta Math. Vietnam"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1186\/s13660-018-1703-1","volume":"2018","author":"G Yuan","year":"2018","unstructured":"Yuan, G., Hu, W.: A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations. J. Inequal. Appl. 2018, 113 (2018)","journal-title":"J. Inequal. Appl."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86653-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T22:50:31Z","timestamp":1673218231000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86653-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866525","9783030866532"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86653-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"466","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}