{"oa_version":"None","date_published":"2008-10-01T00:00:00Z","title":"Parallel algorithms for approximation of distance maps on parametric surfaces","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","publication_status":"published","language":[{"iso":"eng"}],"publication":"ACM Transactions on Graphics","status":"public","_id":"18431","day":"01","citation":{"short":"O. Weber, Y.S. Devir, A.M. Bronstein, M.M. Bronstein, R. Kimmel, ACM Transactions on Graphics 27 (2008).","ista":"Weber O, Devir YS, Bronstein AM, Bronstein MM, Kimmel R. 2008. Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Transactions on Graphics. 27(4), 104.","ieee":"O. Weber, Y. S. Devir, A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Parallel algorithms for approximation of distance maps on parametric surfaces,” ACM Transactions on Graphics, vol. 27, no. 4. Association for Computing Machinery, 2008.","ama":"Weber O, Devir YS, Bronstein AM, Bronstein MM, Kimmel R. Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Transactions on Graphics. 2008;27(4). doi:10.1145/1409625.1409626","mla":"Weber, Ofir, et al. “Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces.” ACM Transactions on Graphics, vol. 27, no. 4, 104, Association for Computing Machinery, 2008, doi:10.1145/1409625.1409626.","apa":"Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2008). Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Transactions on Graphics. Association for Computing Machinery. https://doi.org/10.1145/1409625.1409626","chicago":"Weber, Ofir, Yohai S. Devir, Alex M. Bronstein, Michael M. Bronstein, and Ron Kimmel. “Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces.” ACM Transactions on Graphics. Association for Computing Machinery, 2008. https://doi.org/10.1145/1409625.1409626."},"article_processing_charge":"No","intvolume":" 27","quality_controlled":"1","issue":"4","abstract":[{"text":"We present an efficient O(n) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up to four orders of magnitude improvement in execution time compared to the state-of-the-art algorithms.","lang":"eng"}],"doi":"10.1145/1409625.1409626","extern":"1","date_created":"2024-10-15T11:20:55Z","type":"journal_article","article_number":"104","date_updated":"2024-12-18T14:46:45Z","month":"10","scopus_import":"1","author":[{"last_name":"Weber","first_name":"Ofir","full_name":"Weber, Ofir"},{"full_name":"Devir, Yohai S.","first_name":"Yohai S.","last_name":"Devir"},{"first_name":"Alexander","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"last_name":"Kimmel","first_name":"Ron","full_name":"Kimmel, Ron"}],"publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"year":"2008","volume":27}