{"id":"https://openalex.org/W1575164524","doi":"https://doi.org/10.1007/3-540-58218-5_30","title":"Computing the L 1-diameter and center of a simple rectilinear polygon in parallel","display_name":"Computing the L 1-diameter and center of a simple rectilinear polygon in parallel","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1575164524","doi":"https://doi.org/10.1007/3-540-58218-5_30","mag":"1575164524"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-58218-5_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58218-5_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5058227744","display_name":"Sven Schuierer","orcid":"https://orcid.org/0000-0003-1659-0941"},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]},{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["CH","DE"],"is_corresponding":true,"raw_author_name":"Sven Schuierer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Rheinstr. 10-12, D-79104, Freiburg, Germany","Universit\u00e4t Freiburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Rheinstr. 10-12, D-79104, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Universit\u00e4t Freiburg","institution_ids":["https://openalex.org/I154338468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058227744"],"corresponding_institution_ids":["https://openalex.org/I154338468","https://openalex.org/I161046081"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2614,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.47323944,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"326","last_page":"337"},"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.9998999834060669,"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.9998999834060669,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9898999929428101,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/simple-polygon","display_name":"Simple polygon","score":0.9464038610458374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7049387097358704},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.6874324679374695},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6691159605979919},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5737462639808655},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5472722053527832},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.5378811359405518},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5045768022537231},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49089986085891724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48307541012763977},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4548434019088745},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4507744312286377},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4487360119819641},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4308728873729706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3708575665950775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37043288350105286},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.27361419796943665},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19085371494293213}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.9464038610458374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7049387097358704},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.6874324679374695},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6691159605979919},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5737462639808655},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5472722053527832},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.5378811359405518},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5045768022537231},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49089986085891724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48307541012763977},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4548434019088745},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4507744312286377},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4487360119819641},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4308728873729706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3708575665950775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37043288350105286},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.27361419796943665},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19085371494293213},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-58218-5_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-58218-5_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.6151","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.6151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.informatik.uni-bonn.de/I/staff/schuierer/publications/sch:par-L1-diam.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W40648124","https://openalex.org/W577570849","https://openalex.org/W1511833900","https://openalex.org/W1575164524","https://openalex.org/W1584215226","https://openalex.org/W1603369313","https://openalex.org/W1612751597","https://openalex.org/W1975883249","https://openalex.org/W1990495796","https://openalex.org/W1990613315","https://openalex.org/W2001876175","https://openalex.org/W2003273060","https://openalex.org/W2008574450","https://openalex.org/W2043144539","https://openalex.org/W2044993223","https://openalex.org/W2047596954","https://openalex.org/W2073145634","https://openalex.org/W2097140520","https://openalex.org/W2115636961","https://openalex.org/W2120490947","https://openalex.org/W4299815227"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2389833224","https://openalex.org/W2372903818","https://openalex.org/W2154329468","https://openalex.org/W1567510565","https://openalex.org/W2380220436","https://openalex.org/W2239436216","https://openalex.org/W2379265227","https://openalex.org/W1963624385"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}