{"id":"https://openalex.org/W2143285913","doi":"https://doi.org/10.1145/1810959.1810968","title":"Better bounds on the union complexity of locally fat objects","display_name":"Better bounds on the union complexity of locally fat objects","publication_year":2010,"publication_date":"2010-06-13","ids":{"openalex":"https://openalex.org/W2143285913","doi":"https://doi.org/10.1145/1810959.1810968","mag":"2143285913"},"language":"en","primary_location":{"id":"doi:10.1145/1810959.1810968","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810959.1810968","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-sixth annual symposium on Computational geometry","raw_type":"proceedings-article"},"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/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":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["TU Eindhoven, Eindhoven, Netherlands","(TU Eindhoven, Eindhoven, Netherlands)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"(TU Eindhoven, Eindhoven, Netherlands)","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.1737,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91449566,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"47"},"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.9994000196456909,"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.9994000196456909,"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.9965000152587891,"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.9957000017166138,"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/logarithm","display_name":"Logarithm","score":0.7102360725402832},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6235991716384888},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5799977779388428},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5749735236167908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5571475028991699},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5451123714447021},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5201266407966614},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5183807015419006},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4762313961982727},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4354560375213623},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.41091740131378174},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.396648645401001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3318560719490051},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18887314200401306},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13191130757331848},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0907573401927948}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7102360725402832},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6235991716384888},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5799977779388428},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5749735236167908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5571475028991699},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5451123714447021},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5201266407966614},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5183807015419006},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4762313961982727},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4354560375213623},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.41091740131378174},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.396648645401001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3318560719490051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18887314200401306},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13191130757331848},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0907573401927948},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1810959.1810968","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1810959.1810968","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-sixth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/4094f42f-20bf-4240-a029-5403852d84f6","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/4094f42f-20bf-4240-a029-5403852d84f6","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 2010, Better bounds for the union complexity of locally fat objects. in Proceedings 26th Annual ACM Symposium on Computational Geometry (SoCG'10, Snowbird UT, USA, June 13-16, 2010). Association for Computing Machinery, Inc., New York NY, pp. 39-47.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/4094f42f-20bf-4240-a029-5403852d84f6","is_oa":false,"landing_page_url":"http://doi.acm.org/10.1145/1810959.1810968","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":"Berg, de, M T 2010, Better bounds for the union complexity of locally fat objects. in Proceedings 26th Annual ACM Symposium on Computational Geometry (SoCG'10, Snowbird UT, USA, June 13-16, 2010). Association for Computing Machinery, Inc., New York NY, pp. 39-47.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1976173476","https://openalex.org/W1980092773","https://openalex.org/W2027190503","https://openalex.org/W2028747718","https://openalex.org/W2041935575","https://openalex.org/W2054236013","https://openalex.org/W2065106456","https://openalex.org/W2099563944","https://openalex.org/W2105246008","https://openalex.org/W2134898774","https://openalex.org/W2153204081","https://openalex.org/W2155923807","https://openalex.org/W2165142526","https://openalex.org/W2170429689","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2046736294","https://openalex.org/W4401442391","https://openalex.org/W48199998","https://openalex.org/W1519526186","https://openalex.org/W2980815195","https://openalex.org/W2260200182","https://openalex.org/W4293584968","https://openalex.org/W2384758770","https://openalex.org/W4367665025","https://openalex.org/W2626784971"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2],"the":[3,22,31,36,45],"union":[4],"complexity":[5],"of":[6,9,34,38],"a":[7,51],"set":[8],"n":[10],"constant-complexity":[11],"locally":[12],"fat":[13],"objects":[14,41],"(which":[15],"can":[16],"be":[17],"curved":[18],"and/or":[19],"non-convex)":[20],"in":[21],"plane":[23],"is":[24,30],"O(\u03bbt+2(n)":[25],"log":[26],"n),":[27],"where":[28],"t":[29],"maximum":[32],"number":[33],"times":[35],"boundaries":[37],"any":[39],"two":[40],"intersect.":[42],"This":[43],"improves":[44],"previously":[46],"best":[47],"known":[48],"bound":[49],"by":[50],"logarithmic":[52],"factor.":[53]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}