{"id":"https://openalex.org/W1791954569","doi":"https://doi.org/10.1007/978-3-319-12691-3_10","title":"Guarding Monotone Art Galleries with Sliding Cameras in Linear Time","display_name":"Guarding Monotone Art Galleries with Sliding Cameras in Linear Time","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1791954569","doi":"https://doi.org/10.1007/978-3-319-12691-3_10","mag":"1791954569"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-12691-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12691-3_10","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/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068826527","display_name":"St\u00e9phane Durocher","orcid":"https://orcid.org/0000-0002-6589-3538"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephane Durocher","raw_affiliation_strings":["Department of Computer Science, University of Manitoba, Winnipeg, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, Winnipeg, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044857258","display_name":"Saeed Mehrabi","orcid":"https://orcid.org/0000-0003-0994-6428"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Saeed Mehrabi","raw_affiliation_strings":["Department of Computer Science, University of Manitoba, Winnipeg, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, Winnipeg, Canada","institution_ids":["https://openalex.org/I46247651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044857258"],"corresponding_institution_ids":["https://openalex.org/I46247651"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.7207,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.95211268,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"125"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/monotone-polygon","display_name":"Monotone polygon","score":0.8766417503356934},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6345497369766235},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5692760944366455},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5632550120353699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5310070514678955},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.5180404186248779},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.47109517455101013},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4512166976928711},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.4493194818496704},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.4424494504928589},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43885117769241333},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42948007583618164},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4152890145778656},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4103337228298187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38495776057243347},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.334493488073349},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.22435203194618225},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12724366784095764}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.8766417503356934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6345497369766235},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5692760944366455},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5632550120353699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5310070514678955},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.5180404186248779},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.47109517455101013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4512166976928711},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.4493194818496704},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.4424494504928589},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43885117769241333},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42948007583618164},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4152890145778656},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4103337228298187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38495776057243347},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.334493488073349},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.22435203194618225},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12724366784095764},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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":4,"locations":[{"id":"doi:10.1007/978-3-319-12691-3_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12691-3_10","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:pure.tue.nl:openaire_cris_publications/ad733ad4-b277-41e7-8a0b-a7700b263630","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/ad733ad4-b277-41e7-8a0b-a7700b263630","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M T, Durocher, S & Mehrabi, S 2014, Guarding monotone art galleries with sliding cameras in linear time. in Z Zhang, L Wu, W Xu & D Z Du (eds), Combinatorial Optimization and Applications (8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014. Proceedings). Lecture Notes in Computer Science, vol. 8881, Springer, pp. 113-125, 8th International Conference on Combinatorial Optimization and Applications (COCOA 2014), Mailea, Maui, Hawaii, United States, 19/12/14. https://doi.org/10.1007/978-3-319-12691-3_10","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.713.8556","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.713.8556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umanitoba.ca/%7Edurocher/research/pubs/durocherCOCOA2014.pdf","raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/ad733ad4-b277-41e7-8a0b-a7700b263630","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/ad733ad4-b277-41e7-8a0b-a7700b263630","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorial Optimization and Applications (8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014. Proceedings), 113 - 125","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5799999833106995,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W132285569","https://openalex.org/W1479913796","https://openalex.org/W1503738633","https://openalex.org/W1973521202","https://openalex.org/W2059897834","https://openalex.org/W2063442090","https://openalex.org/W2087422927","https://openalex.org/W2094658339","https://openalex.org/W2112756535","https://openalex.org/W2115708125","https://openalex.org/W2153108139","https://openalex.org/W4238631041"],"related_works":["https://openalex.org/W2253118885","https://openalex.org/W2951545900","https://openalex.org/W60809328","https://openalex.org/W2382946950","https://openalex.org/W2028695830","https://openalex.org/W1574566055","https://openalex.org/W2086175337","https://openalex.org/W78499400","https://openalex.org/W2618053861","https://openalex.org/W1791954569"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}