{"id":"https://openalex.org/W2145567229","doi":"https://doi.org/10.1109/visual.2003.1250375","title":"Out-of-core isosurface extraction of time-varying fields over irregular grids","display_name":"Out-of-core isosurface extraction of time-varying fields over irregular grids","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2145567229","doi":"https://doi.org/10.1109/visual.2003.1250375","mag":"2145567229"},"language":"en","primary_location":{"id":"doi:10.1109/visual.2003.1250375","is_oa":false,"landing_page_url":"https://doi.org/10.1109/visual.2003.1250375","pdf_url":null,"source":{"id":"https://openalex.org/S120877133","display_name":"IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control","issn_l":"0885-3010","issn":["0885-3010","1525-8955","2373-7840"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control","raw_type":"proceedings-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/A5070100758","display_name":"Yi\u2010Jen Chiang","orcid":"https://orcid.org/0000-0001-7822-6200"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yi-Jen Chiang","raw_affiliation_strings":["Department of Computer and Information Science, Polytechnic University, USA","Dept. of Comput. & Inf. Sci., Polytech. Univ., Brooklyn, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Polytechnic University, USA","institution_ids":[]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., Polytech. Univ., Brooklyn, NY, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070100758"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6104,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.92469687,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"217","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9965000152587891,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.9965000152587891,"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/T11106","display_name":"Data Management and Algorithms","score":0.9894999861717224,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9666000008583069,"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/isosurface","display_name":"Isosurface","score":0.9535909295082092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8336869478225708},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5732207298278809},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5657788515090942},{"id":"https://openalex.org/keywords/out-of-core-algorithm","display_name":"Out-of-core algorithm","score":0.551489531993866},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5415760278701782},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5257312059402466},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5169786214828491},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5122917890548706},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45858120918273926},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.44163280725479126},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.412275493144989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3503938317298889},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3130072355270386},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.306144654750824},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.24994412064552307},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23873767256736755},{"id":"https://openalex.org/keywords/visualization","display_name":"Visualization","score":0.17134374380111694},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.16522973775863647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1458514928817749}],"concepts":[{"id":"https://openalex.org/C45107383","wikidata":"https://www.wikidata.org/wiki/Q1311829","display_name":"Isosurface","level":3,"score":0.9535909295082092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8336869478225708},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5732207298278809},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5657788515090942},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.551489531993866},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5415760278701782},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5257312059402466},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5169786214828491},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5122917890548706},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45858120918273926},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.44163280725479126},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.412275493144989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3503938317298889},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3130072355270386},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.306144654750824},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.24994412064552307},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23873767256736755},{"id":"https://openalex.org/C36464697","wikidata":"https://www.wikidata.org/wiki/Q451553","display_name":"Visualization","level":2,"score":0.17134374380111694},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.16522973775863647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1458514928817749},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/visual.2003.1250375","is_oa":false,"landing_page_url":"https://doi.org/10.1109/visual.2003.1250375","pdf_url":null,"source":{"id":"https://openalex.org/S120877133","display_name":"IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control","issn_l":"0885-3010","issn":["0885-3010","1525-8955","2373-7840"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1565302540","https://openalex.org/W1593675831","https://openalex.org/W2017799838","https://openalex.org/W2046441184","https://openalex.org/W2058566003","https://openalex.org/W2063959509","https://openalex.org/W2068587771","https://openalex.org/W2111734174","https://openalex.org/W2114123275","https://openalex.org/W2116866329","https://openalex.org/W2125039738","https://openalex.org/W2128799681","https://openalex.org/W2129307378","https://openalex.org/W2135609792","https://openalex.org/W2142499637","https://openalex.org/W2155624253","https://openalex.org/W2158994814","https://openalex.org/W2170209962","https://openalex.org/W2229412420","https://openalex.org/W2534349997","https://openalex.org/W2539955899","https://openalex.org/W2978236779","https://openalex.org/W3137820248","https://openalex.org/W3144437408","https://openalex.org/W3146003443","https://openalex.org/W4255574753","https://openalex.org/W6654542665","https://openalex.org/W6666447997","https://openalex.org/W6677543089","https://openalex.org/W6682634769","https://openalex.org/W6729004050"],"related_works":["https://openalex.org/W2116114323","https://openalex.org/W2978236779","https://openalex.org/W2112179508","https://openalex.org/W2167490281","https://openalex.org/W2140389254","https://openalex.org/W2158994814","https://openalex.org/W2100184281","https://openalex.org/W3144437408","https://openalex.org/W2145567229","https://openalex.org/W859635240"],"abstract_inverted_index":{"In":[0,219],"this":[1],"paper,":[2],"we":[3,180],"propose":[4],"a":[5,67,117],"novel":[6,118],"out-of-core":[7],"isosurface":[8,76,208,249],"extraction":[9],"technique":[10,22,244],"for":[11,74,233],"large":[12],"time-varying":[13,234],"fields":[14],"over":[15],"irregular":[16],"grids.":[17],"We":[18,64,137],"employ":[19],"our":[20,32,216,243],"meta-cell":[21],"to":[23,36,70,126,197,256],"explore":[24],"the":[25,29,38,49,72,84,88,123,130,140,186,194,199,206,213,223,248],"spatial":[26],"coherence":[27,40,86,132],"of":[28,83,129,153,161,215],"data,":[30],"and":[31,59,95,107,122,168,171,175,204],"time":[33,68,79,93,113,141,187],"tree":[34,69,80,114,142],"algorithm":[35,115,226],"consider":[37],"temporal":[39,85,131],"as":[41,99,165],"well.":[42],"Our":[43],"one-time":[44],"preprocessing":[45],"phase":[46],"first":[47],"partitions":[48],"dataset":[50],"into":[51],"meta-cells":[52,73,201],"that":[53,145],"cluster":[54],"spatially":[55],"neighboring":[56],"cells":[57],"together":[58,189],"are":[60,103],"stored":[61,104],"in":[62,105,133,185,193],"disk.":[63],"then":[65],"build":[66],"index":[71],"fast":[75],"extraction.":[77],"The":[78,112,210],"takes":[81],"advantage":[82],"among":[87],"scalar":[89],"values":[90],"at":[91],"different":[92],"steps,":[94],"uses":[96],"BBIO":[97,195],"trees":[98],"secondary":[100],"structures,":[101],"which":[102],"disk":[106,203],"support":[108],"I/O-optimal":[109,191],"interval":[110],"searches.":[111],"employs":[116],"meta-interval":[119],"collapsing":[120],"scheme":[121],"buffer":[124],"technique,":[125],"take":[127],"care":[128],"an":[134],"I/O-efficient":[135],"way.":[136],"further":[138],"make":[139],"cache-oblivious,":[143],"so":[144],"searching":[146],"on":[147],"it":[148],"automatically":[149],"performs":[150],"optimal":[151,182],"number":[152],"block":[154],"transfers":[155],"between":[156,166,172],"any":[157],"two":[158],"consecutive":[159],"levels":[160],"memory":[162,170,174],"hierarchy":[163],"(such":[164],"cache":[167],"main":[169,173,241],"disk)":[176],"simultaneously.":[177],"At":[178],"run-time,":[179],"perform":[181],"cache-oblivious":[183],"searches":[184,192],"tree,":[188],"with":[190,222],"trees,":[196],"read":[198],"active":[200],"from":[202,251],"generate":[205],"queried":[207],"efficiently.":[209],"experiments":[211],"demonstrate":[212],"effectiveness":[214],"new":[217],"technique.":[218],"particular,":[220],"compared":[221],"query-optimal":[224],"main-memory":[225],"by":[227],"Cignoni":[228],"et":[229],"al.":[230],"(1997)":[231],"(extended":[232],"fields)":[235],"when":[236],"there":[237],"is":[238],"not":[239],"enough":[240],"memory,":[242],"can":[245],"speed":[246],"up":[247],"queries":[250],"more":[252],"than":[253,258],"18":[254],"hours":[255],"less":[257],"4":[259],"minutes.":[260]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}