{"id":"https://openalex.org/W2078721290","doi":"https://doi.org/10.1145/2525314.2525364","title":"Output-sensitive well-separated pair decompositions for dynamic point sets","display_name":"Output-sensitive well-separated pair decompositions for dynamic point sets","publication_year":2013,"publication_date":"2013-11-05","ids":{"openalex":"https://openalex.org/W2078721290","doi":"https://doi.org/10.1145/2525314.2525364","mag":"2078721290"},"language":"en","primary_location":{"id":"doi:10.1145/2525314.2525364","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2525314.2525364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","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/A5012767267","display_name":"Eunhui Park","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eunhui Park","raw_affiliation_strings":["University of Maryland, College Park, Maryland"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016442699","display_name":"David M. Mount","orcid":"https://orcid.org/0000-0002-3290-8932"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David M. Mount","raw_affiliation_strings":["University of Maryland, College Park, Maryland"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5012767267"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.6074221,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.79061198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"354","last_page":"363"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.6148170828819275},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6070852875709534},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.5870468020439148},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5766506791114807},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5700847506523132},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5660951137542725},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5332282185554504},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5141651630401611},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5134161710739136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47161605954170227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44740086793899536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4299091696739197},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4278738498687744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3930589556694031},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15444228053092957},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11889725923538208},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.07865345478057861}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6148170828819275},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6070852875709534},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.5870468020439148},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5766506791114807},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5700847506523132},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5660951137542725},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5332282185554504},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5141651630401611},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5134161710739136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47161605954170227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44740086793899536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4299091696739197},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4278738498687744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3930589556694031},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15444228053092957},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11889725923538208},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.07865345478057861},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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.1145/2525314.2525364","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2525314.2525364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3024094262","display_name":null,"funder_award_id":"N00014-08-1-1015","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G4588769778","display_name":null,"funder_award_id":"CCF-1117259","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W3423378","https://openalex.org/W596522316","https://openalex.org/W1497953515","https://openalex.org/W1505970908","https://openalex.org/W1555007779","https://openalex.org/W1769399376","https://openalex.org/W2000198477","https://openalex.org/W2018804864","https://openalex.org/W2025791989","https://openalex.org/W2045134120","https://openalex.org/W2054011861","https://openalex.org/W2056578260","https://openalex.org/W2083206954","https://openalex.org/W2134479550","https://openalex.org/W2142602416","https://openalex.org/W2161008043","https://openalex.org/W2208163925","https://openalex.org/W2220451813","https://openalex.org/W2395889972","https://openalex.org/W4243060596"],"related_works":["https://openalex.org/W3198856780","https://openalex.org/W2952032592","https://openalex.org/W4323570454","https://openalex.org/W2366250615","https://openalex.org/W2384380565","https://openalex.org/W2355707807","https://openalex.org/W3022165982","https://openalex.org/W16307331","https://openalex.org/W2008652244","https://openalex.org/W2045787581"],"abstract_inverted_index":{"The":[0,45],"well-separated":[1],"pair":[2],"decomposition":[3],"(WSPD)":[4],"is":[5,30],"a":[6,13,23,31,75],"fundamental":[7],"structure":[8],"in":[9,19,50],"computational":[10],"geometry.":[11],"Given":[12],"set":[14],"P":[15,40],"of":[16,34,39,73],"n":[17],"points":[18,78],"d-dimensional":[20],"space":[21],"and":[22,64],"positive":[24],"separation":[25],"parameter":[26],"s,":[27],"an":[28],"s-WSPD":[29],"concise":[32],"representation":[33],"all":[35],"the":[36,71],"O(n2)":[37],"pairs":[38],"requiring":[41],"only":[42],"O(sdn)":[43],"storage.":[44],"WSPD":[46,76],"has":[47],"numerous":[48],"applications":[49],"spatial":[51],"data":[52],"processing,":[53],"such":[54],"as":[55],"computing":[56],"spanner":[57],"graphs,":[58],"minimum":[59],"spanning":[60],"trees,":[61],"shortest-path":[62],"oracles,":[63],"statistics":[65],"on":[66],"interpoint":[67],"distances.":[68],"We":[69],"consider":[70],"problem":[72],"maintaining":[74],"when":[77],"are":[79],"inserted":[80],"to":[81],"or":[82],"deleted":[83],"from":[84],"P.":[85]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}