{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:56Z","timestamp":1759063796017},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2002,8]]},"abstract":"<jats:p> We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant amount of memory beyond that required to store the subdivision. The algorithm is a refinement of a method introduced by de Berg et al (1997), that reduces the worst case running time from O(n<jats:sup>2<\/jats:sup>) to O(n log n). We also give experimental results that show that our modified algorithm runs faster not only in the worst case, but also in many realistic cases. <\/jats:p>","DOI":"10.1142\/s0218195902000906","type":"journal-article","created":{"date-parts":[[2002,8,29]],"date-time":"2002-08-29T23:21:36Z","timestamp":1030663296000},"page":"297-308","source":"Crossref","is-referenced-by-count":20,"title":["AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE"],"prefix":"10.1142","volume":"12","author":[{"given":"PROSENJIT","family":"BOSE","sequence":"first","affiliation":[{"name":"School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada"}]},{"given":"PAT","family":"MORIN","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","first-page":"8","author":"Alliez P.","year":"1998","journal-title":"McGill University"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1080\/136588197242310"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1137\/0215023"},{"key":"p_7","first-page":"69","author":"Gold C. M.","year":"1978","journal-title":"Proceedings of the Canadian Cartographic Association Annual Meeting"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1145\/359024.359029"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90051-8"},{"key":"p_13","first-page":"90","author":"Peuquet D. J.","year":"1990","journal-title":"Francis"},{"key":"p_14","first-page":"100","author":"Peuquet D. J.","year":"1990","journal-title":"Francis"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195902000906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:27:55Z","timestamp":1565123275000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195902000906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,8]]}},"alternative-id":["10.1142\/S0218195902000906"],"URL":"https:\/\/doi.org\/10.1142\/s0218195902000906","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}