{"id":"https://openalex.org/W2172137407","doi":"https://doi.org/10.1142/s0218195993000257","title":"APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS","display_name":"APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2172137407","doi":"https://doi.org/10.1142/s0218195993000257","mag":"2172137407"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195993000257","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000257","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 &amp; 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/A5065368881","display_name":"Leonidas Guibas","orcid":"https://orcid.org/0000-0002-8315-4886"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"LEONIDAS J. GUIBAS","raw_affiliation_strings":["DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA","Dept. of Computer Science, Stanford, CA USA 94305, USA","DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA; Dept. of Computer Science, Stanford, CA USA 94305, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA","institution_ids":[]},{"raw_affiliation_string":"Dept. of Computer Science, Stanford, CA USA 94305, USA","institution_ids":[]},{"raw_affiliation_string":"DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA; Dept. of Computer Science, Stanford, CA USA 94305, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038416046","display_name":"John Hershberger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"JOHN E. HERSHBERGER","raw_affiliation_strings":["DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEC SRC, 130 Lytton Ave, Palo Alto, CA USA 94301, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOSEPH S.B. MITCHELL","raw_affiliation_strings":["Dept. of Applied Math, SUNY, Stony Brook, NY USA 11794\u20133600, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Applied Math, SUNY, Stony Brook, NY USA 11794\u20133600, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I1287378978","display_name":"University of British Columbia Hospital","ror":"https://ror.org/00frst980","country_code":"CA","type":"healthcare","lineage":["https://openalex.org/I1287378978","https://openalex.org/I141074466","https://openalex.org/I141074466","https://openalex.org/I141945490","https://openalex.org/I2799475292"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"JACK SCOTT SNOEYINK","raw_affiliation_strings":["Dept. of Computer Science, UBC, Vancouver, B.C. Canada V6T 1Z2, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, UBC, Vancouver, B.C. Canada V6T 1Z2, Canada","institution_ids":["https://openalex.org/I1287378978"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5065368881"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7333,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.89053672,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"03","issue":"04","first_page":"383","last_page":"415"},"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9932000041007996,"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/subdivision","display_name":"Subdivision","score":0.8377307057380676},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7750569581985474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7456722855567932},{"id":"https://openalex.org/keywords/polygonal-chain","display_name":"Polygonal chain","score":0.6557227373123169},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6271955966949463},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.5801894664764404},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5256068706512451},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5183857083320618},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4743824303150177},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4112803637981415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3688855767250061},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3209803104400635},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1889307200908661},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.16356465220451355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14279711246490479}],"concepts":[{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.8377307057380676},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7750569581985474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7456722855567932},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.6557227373123169},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6271955966949463},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5801894664764404},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5256068706512451},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5183857083320618},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4743824303150177},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4112803637981415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3688855767250061},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3209803104400635},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1889307200908661},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.16356465220451355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14279711246490479},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195993000257","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195993000257","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 &amp; 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/W2090451920","https://openalex.org/W1993308768","https://openalex.org/W1911472513","https://openalex.org/W2185857837","https://openalex.org/W2035680816","https://openalex.org/W1980201470","https://openalex.org/W2963303948","https://openalex.org/W2100560639","https://openalex.org/W1547418662","https://openalex.org/W2904249403"],"abstract_inverted_index":{"We":[0,30,63,81],"study":[1],"several":[2],"variations":[3],"on":[4],"one":[5],"basic":[6],"approach":[7],"to":[8,43],"the":[9,19,27,35,47,56],"task":[10],"of":[11,50,78],"simplifying":[12],"a":[13],"plane":[14],"polygon":[15],"or":[16,37,53,70],"subdivision:":[17],"Fatten":[18],"given":[20],"object":[21],"and":[22,41,87],"construct":[23],"an":[24],"approximation":[25],"inside":[26],"fattened":[28],"region.":[29],"investigate":[31],"fattening":[32],"by":[33,58],"convolving":[34],"segments":[36],"vertices":[38],"with":[39,46,54,89],"disks":[40],"attempt":[42],"approximate":[44],"objects":[45],"minimum":[48],"number":[49],"line":[51],"segments,":[52],"near":[55],"minimum,":[57],"using":[59],"efficient":[60],"greedy":[61],"algorithms.":[62],"give":[64],"some":[65],"variants":[66],"that":[67,84],"have":[68],"linear":[69],"O(n":[71],"log":[72],"n)":[73],"algorithms":[74],"approximating":[75,85,88],"polygonal":[76],"chains":[77,90],"n":[79],"segments.":[80],"also":[82],"show":[83],"subdivisions":[86],"with.":[91],"no":[92],"self-intersections":[93],"are":[94],"NP-hard.":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
