{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:21:42Z","timestamp":1777735302697,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,27]],"date-time":"2017-11-27T00:00:00Z","timestamp":1511740800000},"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":[[2017,11,27]]},"DOI":"10.1145\/3145690.3145729","type":"proceedings-article","created":{"date-parts":[[2017,11,20]],"date-time":"2017-11-20T16:36:28Z","timestamp":1511195788000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Visualization and labeling of point clouds in virtual reality"],"prefix":"10.1145","author":[{"given":"Jonathan Dyssel","family":"Stets","sequence":"first","affiliation":[{"name":"Technical University of Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongbin","family":"Sun","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wiley","family":"Corning","sequence":"additional","affiliation":[{"name":"MIT Media Lab"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott W.","family":"Greenwald","sequence":"additional","affiliation":[{"name":"MIT Media Lab"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_3_2_1_2_1","volume-title":"Building a Balanced k-d Tree in O(kn log n) Time. CoRR abs\/1410.5420","author":"Russell A.","year":"2014","unstructured":"Russell A. Brown . 2014. Building a Balanced k-d Tree in O(kn log n) Time. CoRR abs\/1410.5420 ( 2014 ). http:\/\/arxiv.org\/abs\/1410.5420 Russell A. Brown. 2014. Building a Balanced k-d Tree in O(kn log n) Time. CoRR abs\/1410.5420 (2014). http:\/\/arxiv.org\/abs\/1410.5420"},{"key":"e_1_3_2_1_3_1","unstructured":"Semantic3d. 2016. Large-Scale Point Cloud Classification Benchmark. (2016). http:\/\/www.semantic3d.net\/  Semantic3d. 2016. Large-Scale Point Cloud Classification Benchmark. (2016). http:\/\/www.semantic3d.net\/"}],"event":{"name":"SA '17: SIGGRAPH Asia 2017","location":"Bangkok Thailand","acronym":"SA '17","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["SIGGRAPH Asia 2017 Posters"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3145690.3145729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3145690.3145729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:32Z","timestamp":1750212812000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3145690.3145729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,27]]},"references-count":3,"alternative-id":["10.1145\/3145690.3145729","10.1145\/3145690"],"URL":"https:\/\/doi.org\/10.1145\/3145690.3145729","relation":{},"subject":[],"published":{"date-parts":[[2017,11,27]]},"assertion":[{"value":"2017-11-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}