{"id":"https://openalex.org/W2142302157","doi":"https://doi.org/10.1142/s021819599300021x","title":"ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE","display_name":"ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W2142302157","doi":"https://doi.org/10.1142/s021819599300021x","mag":"2142302157"},"language":"en","primary_location":{"id":"doi:10.1142/s021819599300021x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819599300021x","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/A5050894676","display_name":"Ravi Janardan","orcid":"https://orcid.org/0000-0003-3922-6763"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"RAVI JANARDAN","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050894676"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":1.5619,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82627119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"03","issue":"03","first_page":"331","last_page":"344"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"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":0.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9563999772071838,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9283000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7721990346908569},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7102959752082825},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.600058376789093},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.554376482963562},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.534415602684021},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5253069996833801},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5118226408958435},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5009222030639648},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48944011330604553},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48883360624313354},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.47934895753860474},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4765925109386444},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4607495069503784},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.44466203451156616},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4442344009876251},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43837636709213257},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4321907162666321},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4225085973739624},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4171678423881531},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4145532548427582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3620314598083496},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2843124270439148},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18436530232429504},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.16155597567558289},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1602325141429901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1038159430027008}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7721990346908569},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7102959752082825},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.600058376789093},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.554376482963562},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.534415602684021},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5253069996833801},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5118226408958435},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5009222030639648},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48944011330604553},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48883360624313354},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.47934895753860474},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4765925109386444},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4607495069503784},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.44466203451156616},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4442344009876251},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43837636709213257},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4321907162666321},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4225085973739624},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4171678423881531},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4145532548427582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3620314598083496},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2843124270439148},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18436530232429504},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16155597567558289},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1602325141429901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1038159430027008},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s021819599300021x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819599300021x","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2047412641","https://openalex.org/W2108610933","https://openalex.org/W272710231","https://openalex.org/W3157301475","https://openalex.org/W2950948762","https://openalex.org/W1559968204","https://openalex.org/W4301948600","https://openalex.org/W3083490496","https://openalex.org/W4289281840","https://openalex.org/W2142302157"],"abstract_inverted_index":{"Efficient":[0],"online":[1,183],"algorithms":[2],"are":[3,143],"presented":[4],"for":[5,51,87,120,123,131,151,176],"maintaining":[6],"the":[7,21,33,52,78,88,112,149,152,173,191],"(almost-exact)":[8],"width":[9,34,53,79],"and":[10,30,35,40,43,66,101,130,159,180],"diameter":[11,36,89,113,153,166],"of":[12,23,37,172],"a":[13,169],"dynamic":[14],"planar":[15],"point-set,":[16],"S.":[17],"Let":[18],"n":[19],"be":[20,45,161],"number":[22],"points":[24],"currently":[25],"in":[26,60,68,96,103,190],"S,":[27,38],"let":[28,41],"W":[29],"D":[31],"denote":[32],"respectively,":[39],"\u03b1>1":[42],"\u03b2\u22651":[44],"positive,":[46],"integer-valued":[47],"parameters.":[48],"The":[49,85,165],"algorithm":[50,86,184],"problem":[54,90],"uses":[55,91],"O(\u03b1n)":[56],"space,":[57,93],"supports":[58,94],"updates":[59,95],"O(\u03b1":[61,69],"log":[62,70,98],"2":[63,71],"n)":[64,72,99],"time,":[65,100],"reports":[67,102],"time":[73,105],"an":[74,106,181],"approximation,":[75,107],"\u0174,":[76],"to":[77,111,163,185],"such":[80,114],"that":[81,115],"[Formula:":[82,108,116,137],"see":[83,109,117,138],"text].":[84,118,139],"O(\u03b2n)":[92],"O(\u03b2":[97],"O(\u03b2)":[104],"text],":[110],"Thus,":[119],"instance,":[121],"even":[122],"\u03b1":[124],"as":[125,127,133,135],"small":[126,134],"11,":[128],"\u0174/W\u22641.01,":[129],"\u03b2":[132],"9,":[136],"All":[140],"bounds":[141],"stated":[142],"worst-case.":[144],"Both":[145],"algorithms,":[146],"but":[147],"especially":[148],"one":[150],"problem,":[154],"use":[155],"well-understood":[156],"data":[157],"structures":[158],"should":[160],"simple":[162],"implement.":[164],"result":[167],"yields":[168],"fast":[170],"implementation":[171],"greedy":[174],"heuristic":[175],"maximum-weight":[177],"Euclidean":[178],"matching":[179],"efficient":[182],"maintain":[186],"approximate":[187],"convex":[188],"hulls":[189],"plane.":[192]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}