{"id":"https://openalex.org/W6944675507","doi":"https://doi.org/10.20382/jocg.v13i1a9","title":"Near-optimal algorithms for point-line fitting problems","display_name":"Near-optimal algorithms for point-line fitting problems","publication_year":2022,"publication_date":"2022-01-28","ids":{"openalex":"https://openalex.org/W6944675507","doi":"https://doi.org/10.20382/jocg.v13i1a9"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/3598","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3598","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 13 No. 1 (2022); 226\u2013243","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.20382/jocg.v13i1a9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chen, Jianer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chen, Jianer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Huang, Qin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Qin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Kanj, Iyad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanj, Iyad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Xia, Ge","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xia, Ge","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3393,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73122297,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.8841999769210815,"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.8841999769210815,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.039400000125169754,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.019200000911951065,"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/randomized-algorithm","display_name":"Randomized algorithm","score":0.6078000068664551},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5561000108718872},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5465999841690063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5454999804496765},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5368000268936157},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5084999799728394},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4731000065803528},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46000000834465027},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4383000135421753}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6654000282287598},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6078000068664551},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5561000108718872},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5465999841690063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5368000268936157},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5084999799728394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49639999866485596},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3928999900817871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.390500009059906},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.3653999865055084},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.36090001463890076},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C15482360","wikidata":"https://www.wikidata.org/wiki/Q15238499","display_name":"Monte Carlo algorithm","level":3,"score":0.31279999017715454},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3095000088214874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30550000071525574},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.3034000098705292},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.25540000200271606}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/3598","is_oa":false,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/3598","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Geometry; Vol. 13 No. 1 (2022); 226\u2013243","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.20382/jocg.v13i1a9","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v13i1a9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.20382/jocg.v13i1a9","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v13i1a9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,106,142],"study":[1],"the":[2,20,29,32,37,62,67,78,124,139,153,157,165,172,180],"{\\sc":[3,63,68,84,114,176],"Rich":[4,85,115,177],"Lines}":[5,86,116,178],"problem,":[6,19,71],"which":[7],"is":[8,22,34],"a":[9,23,52,75,97,108,119,135],"fundamental":[10],"point-line":[11],"fitting":[12],"problem":[13,60,65,87],"in":[14,28,103,179],"computational":[15,104],"geometry.":[16,105],"In":[17],"this":[18,59,161],"input":[21],"set":[24,38],"$S$":[25],"of":[26,39,81,127,138,160,175],"points":[27,48],"plane,":[30],"and":[31,66,92],"goal":[33],"to":[35],"compute":[36],"all":[40],"lines":[41],"that":[42,117,168],"each":[43],"covers":[44],"at":[45],"least":[46],"$\\lambda$":[47],"from":[49],"$S$,":[50],"for":[51,74,100,113,134,148],"given":[53],"integer":[54],"parameter":[55,140],"$\\lambda":[56,149],"\\geq":[57],"2$;":[58],"subsumes":[61],"3-Points-on-Line}":[64],"Exact":[69],"Fitting}":[70],"which---the":[72],"latter---asks":[73],"line":[76],"containing":[77],"maximum":[79],"number":[80],"points.":[82],"The":[83],"has":[88],"been":[89],"extensively":[90],"studied,":[91],"its":[93],"solution":[94],"serves":[95],"as":[96],"building":[98],"block":[99],"several":[101],"algorithms":[102],"present":[107],"randomized":[109,162],"Monte":[110],"Carlo":[111],"algorithm":[112,126,163],"achieves":[118],"lower":[120,166],"running":[121,158],"time":[122,159,173],"than":[123],"current-best":[125],"Guibas":[128],"et":[129],"al.~[{\\it":[130],"Computational":[131],"Geometry}":[132],"1996],":[133],"wide":[136],"range":[137],"$\\lambda$.":[141],"derive":[143,170],"lower-bound":[144],"results":[145],"showing":[146],"that,":[147],"=\\Omega(\\sqrt{n":[150],"\\log":[151],"n})$,":[152],"upper":[154],"bound":[155,167],"on":[156,171],"matches":[164],"we":[169],"complexity":[174],"algebraic":[181],"computation":[182],"trees":[183],"model.":[184]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}