{"id":"https://openalex.org/W2156457461","doi":"https://doi.org/10.1145/1998196.1998263","title":"Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons","display_name":"Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons","publication_year":2011,"publication_date":"2011-06-13","ids":{"openalex":"https://openalex.org/W2156457461","doi":"https://doi.org/10.1145/1998196.1998263","mag":"2156457461"},"language":"en","primary_location":{"id":"doi:10.1145/1998196.1998263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1998196.1998263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/3299774/Metis249131.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017968782","display_name":"Mohammad Ali Abam","orcid":"https://orcid.org/0000-0002-8345-8783"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Ali Abam","raw_affiliation_strings":["Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042232059","display_name":"Boris Aronov","orcid":"https://orcid.org/0000-0003-3110-4702"},"institutions":[{"id":"https://openalex.org/I90965887","display_name":"SUNY Polytechnic Institute","ror":"https://ror.org/000fxgx19","country_code":"US","type":"education","lineage":["https://openalex.org/I90965887"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Boris Aronov","raw_affiliation_strings":["Polytechnic Institute of NYU, Brooklyn, New York City, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Polytechnic Institute of NYU, Brooklyn, New York City, NY, USA","institution_ids":["https://openalex.org/I90965887"]}]},{"author_position":"middle","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":["TU Eindhoven, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031200844","display_name":"Amirali Khosravi","orcid":null},"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":"Amirali Khosravi","raw_affiliation_strings":["TU Eindhoven, Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6991,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.70731707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"407","last_page":"416"},"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.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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.9848999977111816,"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/partition","display_name":"Partition (number theory)","score":0.7630155682563782},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.741658627986908},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.700310230255127},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6186213493347168},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5406662225723267},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.525892436504364},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5154417753219604},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5035352110862732},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.49233853816986084},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.4867849051952362},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48070842027664185},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.47478052973747253},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4718484878540039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45658108592033386},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.4366884231567383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3623068332672119},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.2421000897884369},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.19307562708854675},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12900498509407043},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08011335134506226}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7630155682563782},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.741658627986908},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.700310230255127},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6186213493347168},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5406662225723267},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.525892436504364},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5154417753219604},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5035352110862732},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.49233853816986084},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.4867849051952362},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48070842027664185},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.47478052973747253},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4718484878540039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45658108592033386},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.4366884231567383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3623068332672119},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.2421000897884369},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.19307562708854675},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12900498509407043},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08011335134506226},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","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/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/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1998196.1998263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1998196.1998263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","pdf_url":"https://pure.tue.nl/ws/files/3299774/Metis249131.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abam, M A, Aronov, B, Berg, de, M T & Khosravi Dehkordi, A 2011, Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. in Proceedings 27th Annual ACM Symposium on Computational Geometry (SoCG'11, Paris, France, June 13-15, 2011). Association for Computing Machinery, Inc., New York NY, pp. 407-416. https://doi.org/10.1145/1998196.1998263","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:710767","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=710767","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:library.tue.nl:710767","is_oa":false,"landing_page_url":"http://repository.tue.nl/710767","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:tue:oai:pure.tue.nl:publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings 27th Annual ACM Symposium on Computational Geometry (SoCG'11, Paris, France, June 13-15, 2011), 407 - 416","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/801e681a-3e08-484b-ab7c-c6e6f5bd885c","pdf_url":"https://pure.tue.nl/ws/files/3299774/Metis249131.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abam, M A, Aronov, B, Berg, de, M T & Khosravi Dehkordi, A 2011, Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. in Proceedings 27th Annual ACM Symposium on Computational Geometry (SoCG'11, Paris, France, June 13-15, 2011). Association for Computing Machinery, Inc., New York NY, pp. 407-416. https://doi.org/10.1145/1998196.1998263","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3956807472","display_name":null,"funder_award_id":"CCF-08-30691","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320329559","display_name":"Technische Universit\u00e4t Dortmund","ror":"https://ror.org/01k97gp34"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2156457461.pdf","grobid_xml":"https://content.openalex.org/works/W2156457461.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W40648124","https://openalex.org/W1994072278","https://openalex.org/W2001513095","https://openalex.org/W2045363075","https://openalex.org/W2048802156","https://openalex.org/W2059722883","https://openalex.org/W2093890557","https://openalex.org/W2106413026","https://openalex.org/W2609210027","https://openalex.org/W3004540582","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W1988449797","https://openalex.org/W3082218119","https://openalex.org/W2155945776","https://openalex.org/W2102467404","https://openalex.org/W2466150543","https://openalex.org/W1812659169","https://openalex.org/W3016304894","https://openalex.org/W2350839917","https://openalex.org/W2026465854"],"abstract_inverted_index":{"Let":[0],"P":[1,14],"be":[2,85],"a":[3,11,33,41,66,103],"rectilinear":[4],"simple":[5,67],"polygon.":[6],"The":[7],"stabbing":[8,45,73,108],"number":[9,20,74,80],"of":[10,13,21,39,65,81,101],"partition":[12,42,57],"into":[15],"rectangles":[16,22],"is":[17,48,75],"the":[18,37,72,78,99],"maximum":[19,79],"stabbed":[23,86],"by":[24,87],"any":[25,88],"axis-parallel":[26],"line":[27,89],"segment":[28,90],"inside":[29,91],"P.":[30,70,92],"We":[31,60,93],"present":[32],"3-approximation":[34],"algorithm":[35,52,97],"for":[36,58,98],"problem":[38,100],"finding":[40],"with":[43,106],"minimum":[44,107],"number.":[46,109],"It":[47],"based":[49],"on":[50],"an":[51,55,95],"that":[53,83],"finds":[54],"optimal":[56],"histograms.":[59],"also":[61],"study":[62],"Steiner":[63,104],"triangulations":[64],"(non-rectilinear)":[68],"polygon":[69],"Here":[71],"defined":[76],"as":[77],"triangles":[82],"can":[84],"give":[94],"O(1)-approximation":[96],"computing":[102],"triangulation":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}