{"id":"https://openalex.org/W2884727845","doi":"https://doi.org/10.1007/978-3-030-04651-4_34","title":"Does a Robot Path Have Clearance C?","display_name":"Does a Robot Path Have Clearance C?","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2884727845","doi":"https://doi.org/10.1007/978-3-030-04651-4_34","mag":"2884727845"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-04651-4_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_34","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":"book-chapter","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":true,"raw_author_name":"Ovidiu Daescu","raw_affiliation_strings":["University of Texas at Dallas, Richardson, TX, 75080, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX, 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086447656","display_name":"Hemant Malik","orcid":null},"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":"Hemant Malik","raw_affiliation_strings":["University of Texas at Dallas, Richardson, TX, 75080, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Richardson, TX, 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078438902"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13403614,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"521"},"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.9997000098228455,"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.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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.989300012588501,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6916409730911255},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6865394115447998},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6341588497161865},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6109609007835388},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.557993471622467},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5415343046188354},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5128874778747559},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46175384521484375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4328325390815735},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.43053779006004333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4295172393321991},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4145752191543579},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33517828583717346},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22735658288002014},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.13296392560005188}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6916409730911255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6865394115447998},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6341588497161865},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6109609007835388},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.557993471622467},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5415343046188354},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5128874778747559},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46175384521484375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4328325390815735},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43053779006004333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4295172393321991},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4145752191543579},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33517828583717346},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22735658288002014},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.13296392560005188},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-04651-4_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_34","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5199999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1559701472","https://openalex.org/W1964691748","https://openalex.org/W1985010089","https://openalex.org/W2000059698","https://openalex.org/W2001787130","https://openalex.org/W2011124327","https://openalex.org/W2011903683","https://openalex.org/W2015425624","https://openalex.org/W2021895827","https://openalex.org/W2025091313","https://openalex.org/W2027387410","https://openalex.org/W2029286260","https://openalex.org/W2054414323","https://openalex.org/W2070747743","https://openalex.org/W2083387551","https://openalex.org/W2085512211","https://openalex.org/W2126876121","https://openalex.org/W2154628670","https://openalex.org/W2167427782","https://openalex.org/W2218021848","https://openalex.org/W2754990390","https://openalex.org/W4235042979"],"related_works":["https://openalex.org/W2102467404","https://openalex.org/W4387619756","https://openalex.org/W2608536130","https://openalex.org/W2987051945","https://openalex.org/W2154329468","https://openalex.org/W4296464845","https://openalex.org/W2389833224","https://openalex.org/W53644101","https://openalex.org/W1963624385","https://openalex.org/W2056884694"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}