{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:12Z","timestamp":1750220892753,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,14]]},"DOI":"10.1145\/3359997.3365719","type":"proceedings-article","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T22:18:50Z","timestamp":1573769930000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Superimposition of a 3D Scan with a Part for Metrology Applications on a Hololens-Based Platform"],"prefix":"10.1145","author":[{"given":"Carl","family":"Nadeau","sequence":"first","affiliation":[{"name":"Laval University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Laurendeau","sequence":"additional","affiliation":[{"name":"Laval University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Closest point between two rays. Retrieved","author":"Palitri","year":"2019","unstructured":"Palitri . 2019. Closest point between two rays. Retrieved October 8, 2019 from http:\/\/morroworks.palitri.com\/Content\/Docs\/Rays%20closest%20point.pdf Palitri. 2019. Closest point between two rays. Retrieved October 8, 2019 from http:\/\/morroworks.palitri.com\/Content\/Docs\/Rays%20closest%20point.pdf"},{"key":"e_1_3_2_1_2_1","volume-title":"Kabsch algorithm. Retrieved","author":"Wikipedia","year":"2019","unstructured":"Wikipedia . 2019. Kabsch algorithm. Retrieved October 8, 2019 from https:\/\/en.wikipedia.org\/wiki\/Kabsch_algorithm Wikipedia. 2019. Kabsch algorithm. Retrieved October 8, 2019 from https:\/\/en.wikipedia.org\/wiki\/Kabsch_algorithm"}],"event":{"sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"acronym":"VRCAI '19","name":"VRCAI '19: The 17th International Conference on Virtual-Reality Continuum and its Applications in Industry","location":"Brisbane QLD Australia"},"container-title":["Proceedings of the 17th International Conference on Virtual-Reality Continuum and its Applications in Industry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359997.3365719","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3359997.3365719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:31Z","timestamp":1750203871000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3359997.3365719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,14]]},"references-count":2,"alternative-id":["10.1145\/3359997.3365719","10.1145\/3359997"],"URL":"https:\/\/doi.org\/10.1145\/3359997.3365719","relation":{},"subject":[],"published":{"date-parts":[[2019,11,14]]},"assertion":[{"value":"2019-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}