{"id":"https://openalex.org/W2138394562","doi":"https://doi.org/10.1142/s0218195902000906","title":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","display_name":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W2138394562","doi":"https://doi.org/10.1142/s0218195902000906","mag":"2138394562"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195902000906","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195902000906","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013674788","display_name":"Prosenjit Bose","orcid":"https://orcid.org/0000-0002-8906-0573"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PROSENJIT BOSE","raw_affiliation_strings":["School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045902784","display_name":"Pat Morin","orcid":"https://orcid.org/0000-0003-0471-4118"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PAT MORIN","raw_affiliation_strings":["School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":1.9219,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.86423633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"04","first_page":"297","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12549","display_name":"Image and Object Detection Techniques","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.8824899196624756},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8099285364151001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6274281144142151},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6210658550262451},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5607011318206787},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5061036944389343},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5025687217712402},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4569045603275299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4455375671386719},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.44448235630989075},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4370952844619751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35078921914100647},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.09939420223236084},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07403996586799622}],"concepts":[{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.8824899196624756},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8099285364151001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6274281144142151},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6210658550262451},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5607011318206787},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5061036944389343},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5025687217712402},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4569045603275299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4455375671386719},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.44448235630989075},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4370952844619751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35078921914100647},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.09939420223236084},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07403996586799622},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195902000906","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195902000906","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1999527722","https://openalex.org/W2052165970","https://openalex.org/W2081280922","https://openalex.org/W2104800005","https://openalex.org/W2132026455"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W121845590","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W170547082"],"abstract_inverted_index":{"We":[0,68],"describe":[1],"an":[2],"algorithm":[3,39,78],"for":[4],"enumerating":[5],"all":[6],"vertices,":[7],"edges":[8],"and":[9],"faces":[10],"of":[11,18,29,43],"a":[12,26,41,44],"planar":[13],"subdivision":[14],"stored":[15],"in":[16,83,89],"any":[17],"the":[19,36,55,84],"usual":[20],"pointer-based":[21],"representations,":[22],"while":[23],"using":[24],"only":[25,82],"constant":[27],"amount":[28],"memory":[30],"beyond":[31],"that":[32,53,73,75],"required":[33],"to":[34,64],"store":[35],"subdivision.":[37],"The":[38],"is":[40],"refinement":[42],"method":[45],"introduced":[46],"by":[47],"de":[48],"Berg":[49],"et":[50],"al":[51],"(1997),":[52],"reduces":[54],"worst":[56,85],"case":[57],"running":[58],"time":[59],"from":[60],"O(n":[61,65],"2":[62],")":[63],"log":[66],"n).":[67],"also":[69,88],"give":[70],"experimental":[71],"results":[72],"show":[74],"our":[76],"modified":[77],"runs":[79],"faster":[80],"not":[81],"case,":[86],"but":[87],"many":[90],"realistic":[91],"cases.":[92]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}