{"id":"https://openalex.org/W2152625875","doi":"https://doi.org/10.1109/isspa.2010.5605424","title":"Polygonal approximation of planar curves using triangular suppression","display_name":"Polygonal approximation of planar curves using triangular suppression","publication_year":2010,"publication_date":"2010-05-01","ids":{"openalex":"https://openalex.org/W2152625875","doi":"https://doi.org/10.1109/isspa.2010.5605424","mag":"2152625875"},"language":"en","primary_location":{"id":"doi:10.1109/isspa.2010.5605424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspa.2010.5605424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Conference on Information Science, Signal Processing and their Applications (ISSPA 2010)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103216077","display_name":"Mohammad Tanvir Parvez","orcid":"https://orcid.org/0000-0001-9033-014X"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Mohammad Tanvir Parvez","raw_affiliation_strings":["Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068460528","display_name":"Sabri A. Mahmoud","orcid":"https://orcid.org/0000-0002-5432-3206"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"Sabri A. Mahmoud","raw_affiliation_strings":["Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.2719,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.53486034,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"36","issue":null,"first_page":"622","last_page":"625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10531","display_name":"Advanced Vision and Imaging","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9972000122070312,"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/polygonal-chain","display_name":"Polygonal chain","score":0.7630834579467773},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6564621329307556},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.6431819796562195},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.61600661277771},{"id":"https://openalex.org/keywords/parametric-equation","display_name":"Parametric equation","score":0.573652982711792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.566365659236908},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5211539268493652},{"id":"https://openalex.org/keywords/level-set","display_name":"Level set (data structures)","score":0.48410332202911377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4563392698764801},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45311108231544495},{"id":"https://openalex.org/keywords/curve-fitting","display_name":"Curve fitting","score":0.43569377064704895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.404862642288208},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3348190188407898},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.223992258310318}],"concepts":[{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.7630834579467773},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6564621329307556},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.6431819796562195},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.61600661277771},{"id":"https://openalex.org/C99636146","wikidata":"https://www.wikidata.org/wiki/Q35889","display_name":"Parametric equation","level":2,"score":0.573652982711792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.566365659236908},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5211539268493652},{"id":"https://openalex.org/C153008295","wikidata":"https://www.wikidata.org/wiki/Q6535093","display_name":"Level set (data structures)","level":2,"score":0.48410332202911377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4563392698764801},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45311108231544495},{"id":"https://openalex.org/C184389593","wikidata":"https://www.wikidata.org/wiki/Q603159","display_name":"Curve fitting","level":2,"score":0.43569377064704895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.404862642288208},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3348190188407898},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.223992258310318},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"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/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.1109/isspa.2010.5605424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isspa.2010.5605424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th International Conference on Information Science, Signal Processing and their Applications (ISSPA 2010)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1655554306","https://openalex.org/W1965348147","https://openalex.org/W1973022970","https://openalex.org/W1994559772","https://openalex.org/W2002561187","https://openalex.org/W2006609100","https://openalex.org/W2059920718","https://openalex.org/W2066596732","https://openalex.org/W2072072559","https://openalex.org/W2083398076","https://openalex.org/W2099359543","https://openalex.org/W2108556791","https://openalex.org/W2122741244","https://openalex.org/W2123630097","https://openalex.org/W2133059825","https://openalex.org/W2172263315","https://openalex.org/W4210602482"],"related_works":["https://openalex.org/W3092611839","https://openalex.org/W2371436092","https://openalex.org/W2141882063","https://openalex.org/W2034570349","https://openalex.org/W2972433112","https://openalex.org/W1643233150","https://openalex.org/W2128165404","https://openalex.org/W4220831934","https://openalex.org/W2947700015","https://openalex.org/W1994794192"],"abstract_inverted_index":{"In":[0],"this":[1,26],"paper,":[2],"we":[3],"present":[4],"a":[5,28],"novel":[6],"non-parametric":[7],"polygonal":[8,46],"approximation":[9],"algorithm":[10,16,49,63,85],"for":[11,88],"planar":[12],"curves.":[13],"The":[14,61],"proposed":[15,62,84],"first":[17],"selects":[18],"all":[19],"the":[20,23,43,54,65,70,75,83],"breakpoints":[21],"on":[22,74],"contour.":[24],"From":[25],"set,":[27],"smaller":[29],"set":[30],"of":[31,53,59,72],"high":[32],"curvature":[33],"points,":[34],"cut-points,":[35],"are":[36],"obtained.":[37],"An":[38],"optimization":[39],"procedure":[40],"adaptively":[41,50],"finds":[42],"best":[44],"fitting":[45],"approximation.":[47],"Our":[48],"locates":[51],"segments":[52],"contour":[55,66],"with":[56,95],"different":[57],"levels":[58],"details.":[60],"follows":[64],"more":[67],"closely":[68],"where":[69],"level":[71],"details":[73],"curve":[76],"is":[77,86],"high.":[78],"Experimental":[79],"results":[80],"demonstrate":[81],"that":[82],"robust":[87],"noisy,":[89],"real-life":[90],"contours":[91],"and":[92],"compares":[93],"favorably":[94],"other":[96],"algorithms.":[97]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}