{"id":"https://openalex.org/W1570767246","doi":"https://doi.org/10.1007/bfb0054378","title":"Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology","display_name":"Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W1570767246","doi":"https://doi.org/10.1007/bfb0054378","mag":"1570767246"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0054378","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054378","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/A5109049608","display_name":"Hans -Martin Will","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Hans -Martin Will","raw_affiliation_strings":["ETH Z\u00fcrich, Institut f\u00fcr Theoretische Informatik, CH-8092, Z\u00fcrich, Switzerland","Institut f\u00fcr Theoretische Informatik"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Institut f\u00fcr Theoretische Informatik, CH-8092, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109049608"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.13522013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"310","last_page":"321"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.7660183906555176},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6603389978408813},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6348528861999512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.567491888999939},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5371260046958923},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48701220750808716},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45816025137901306},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4361482262611389},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4288492798805237},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4161108732223511},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4160754084587097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3667113184928894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35500478744506836},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2808035612106323},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07631352543830872}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.7660183906555176},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6603389978408813},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6348528861999512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.567491888999939},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5371260046958923},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48701220750808716},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45816025137901306},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4361482262611389},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4288492798805237},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4161108732223511},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4160754084587097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3667113184928894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35500478744506836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2808035612106323},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07631352543830872},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0054378","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0054378","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W644411640","https://openalex.org/W1542085343","https://openalex.org/W1553807233","https://openalex.org/W1595208863","https://openalex.org/W1966950432","https://openalex.org/W1967005434","https://openalex.org/W2013146925","https://openalex.org/W2014464810","https://openalex.org/W2021615496","https://openalex.org/W2031788522","https://openalex.org/W2041775009","https://openalex.org/W2044858517","https://openalex.org/W2048475323","https://openalex.org/W2058432138","https://openalex.org/W2067316723","https://openalex.org/W2071676345","https://openalex.org/W2073041487","https://openalex.org/W2077640988","https://openalex.org/W2092924973","https://openalex.org/W2093537397","https://openalex.org/W2103794058","https://openalex.org/W2113623846","https://openalex.org/W2119236577","https://openalex.org/W2120372728","https://openalex.org/W2122552271","https://openalex.org/W2126876121","https://openalex.org/W2145494964","https://openalex.org/W2998589874","https://openalex.org/W4232703655","https://openalex.org/W4254977685","https://openalex.org/W6632908783"],"related_works":["https://openalex.org/W2026437235","https://openalex.org/W1595976887","https://openalex.org/W3021181284","https://openalex.org/W2148281364","https://openalex.org/W1808167818","https://openalex.org/W414359703","https://openalex.org/W1514742182","https://openalex.org/W1977276706","https://openalex.org/W2951826107","https://openalex.org/W2171535967"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}