{"id":"https://openalex.org/W2080255048","doi":"https://doi.org/10.1016/0925-7721(95)00035-6","title":"Sequential and parallel algorithms for finding a maximum convex polygon","display_name":"Sequential and parallel algorithms for finding a maximum convex polygon","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2080255048","doi":"https://doi.org/10.1016/0925-7721(95)00035-6","mag":"2080255048"},"language":"en","primary_location":{"id":"doi:10.1016/0925-7721(95)00035-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0925-7721(95)00035-6","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","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/A5033310382","display_name":"Paul Fischer","orcid":"https://orcid.org/0000-0003-3296-5301"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Paul Fischer","raw_affiliation_strings":["Lehrstuhl Informatik II, Universit\u00e4t Dortmund, D\u201044221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit\u00e4t Dortmund, D\u201044221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033310382"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":2180,"currency":"USD","value_usd":2180},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.19988987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"187","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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.9948999881744385,"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/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/combinatorics","display_name":"Combinatorics","score":0.7857012748718262},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7270272970199585},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.7057338953018188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6735547184944153},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6641494035720825},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.620751142501831},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5873510241508484},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5462337732315063},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.539704442024231},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5195296406745911},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4875039756298065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47758913040161133},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4606054425239563},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4511302709579468},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.4331774115562439},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4283924102783203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36634087562561035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3474248945713043},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18459978699684143},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1323414146900177},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11107185482978821}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7857012748718262},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7270272970199585},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.7057338953018188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6735547184944153},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6641494035720825},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.620751142501831},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5873510241508484},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5462337732315063},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.539704442024231},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5195296406745911},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4875039756298065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47758913040161133},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4606054425239563},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4511302709579468},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.4331774115562439},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4283924102783203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36634087562561035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3474248945713043},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18459978699684143},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1323414146900177},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11107185482978821},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0925-7721(95)00035-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0925-7721(95)00035-6","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/e07d805f-fa16-4569-a9a9-0e48a45998ba","is_oa":false,"landing_page_url":"http://www2.imm.dtu.dk/pubdb/p.php?2077","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fischer , P 1997 , ' Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon ' , Computational Geometry, Theory and Applications , vol. 7 , no. 3 , pp. 187-200 . < http://www2.imm.dtu.dk/pubdb/p.php?2077 >","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1587300904","https://openalex.org/W2005314985","https://openalex.org/W2007986693","https://openalex.org/W2017921773","https://openalex.org/W2064761827","https://openalex.org/W2082055731","https://openalex.org/W2085933841","https://openalex.org/W2120490947","https://openalex.org/W2129047612","https://openalex.org/W2529775630","https://openalex.org/W3041834803","https://openalex.org/W6635112386","https://openalex.org/W6666443375","https://openalex.org/W6670974350","https://openalex.org/W6728491762"],"related_works":["https://openalex.org/W1574566055","https://openalex.org/W2062138633","https://openalex.org/W2951545900","https://openalex.org/W2080255048","https://openalex.org/W78499400","https://openalex.org/W2176328280","https://openalex.org/W2067605785","https://openalex.org/W2042423125","https://openalex.org/W61405010","https://openalex.org/W2751569073"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}