{"id":"https://openalex.org/W2163688674","doi":"https://doi.org/10.1142/s0218195906002014","title":"CUTTING OUT POLYGONS WITH LINES AND RAYS","display_name":"CUTTING OUT POLYGONS WITH LINES AND RAYS","publication_year":2006,"publication_date":"2006-04-27","ids":{"openalex":"https://openalex.org/W2163688674","doi":"https://doi.org/10.1142/s0218195906002014","mag":"2163688674"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195906002014","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195906002014","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/A5078438902","display_name":"Ovidiu Daescu","orcid":"https://orcid.org/0000-0002-0278-4174"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"OVIDIU DAESCU","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081222445","display_name":"Jun Luo","orcid":"https://orcid.org/0000-0002-7036-5158"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JUN LUO","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":2.5959,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.9018245,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"02n03","first_page":"227","last_page":"248"},"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.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.7763345837593079},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.7438253164291382},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7087820172309875},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6624297499656677},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.6330295205116272},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.611649751663208},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.599681556224823},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.5211843848228455},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.5096452236175537},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4967504143714905},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43136218190193176},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4171954393386841},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.3441120982170105},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2937138080596924},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.24706783890724182},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.16775110363960266},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12221217155456543}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7763345837593079},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.7438253164291382},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7087820172309875},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6624297499656677},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.6330295205116272},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.611649751663208},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.599681556224823},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.5211843848228455},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.5096452236175537},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4967504143714905},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43136218190193176},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4171954393386841},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.3441120982170105},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2937138080596924},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.24706783890724182},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.16775110363960266},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12221217155456543},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/s0218195906002014","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195906002014","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/W2013409484","https://openalex.org/W2053814689","https://openalex.org/W2061951414","https://openalex.org/W2090221723","https://openalex.org/W2132339863"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W1812659169","https://openalex.org/W3036994771","https://openalex.org/W2997571660","https://openalex.org/W2004395316","https://openalex.org/W2913852997","https://openalex.org/W2170271613","https://openalex.org/W1579553590","https://openalex.org/W2980991945","https://openalex.org/W1991526295"],"abstract_inverted_index":{"We":[0],"present":[1],"approximation":[2,90,118],"algorithms":[3,125],"for":[4,39,129],"cutting":[5,76,95,109,122,132],"out":[6],"a":[7,55,80,86,108],"polygon":[8,16],"P":[9,33,48],"with":[10,18],"n":[11],"vertices":[12,20],"from":[13],"another":[14],"convex":[15,37,46],"Q":[17,35,44],"m":[19],"by":[21],"line":[22,28,75],"cuts":[23,29,41],"and":[24,34,47,60],"ray":[25,40,50,94,131],"cuts.":[26],"For":[27,73,92],"we":[30,42,78,97],"require":[31,43],"both":[32],"are":[36,61],"while":[38],"is":[45,49,100,112],"cuttable.":[51],"Our":[52],"results":[53],"answer":[54],"number":[56],"of":[57,119],"open":[58],"problems":[59],"either":[62],"the":[63,74,93,130],"first":[64],"solutions":[65],"or":[66],"significantly":[67],"improve":[68],"over":[69],"previously":[70,127],"known":[71,128],"solutions.":[72],"version,":[77,96],"prove":[79,98],"key":[81],"property":[82],"that":[83,111],"leads":[84],"to":[85,102],"simple,":[87],"constant":[88],"factor":[89],"algorithm.":[91],"it":[99],"possible":[101],"compute":[103],"in":[104],"almost":[105],"linear":[106],"time":[107],"sequence":[110],"an":[113,120],"O(":[114],"log":[115],"2":[116],"n)-factor":[117],"optimal":[121],"sequence.":[123],"No":[124],"were":[126],"version.":[133]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}