{"id":"https://openalex.org/W1588722399","doi":"https://doi.org/10.1007/978-3-540-30551-4_11","title":"Voronoi Diagrams with a Transportation Network on the Euclidean Plane","display_name":"Voronoi Diagrams with a Transportation Network on the Euclidean Plane","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1588722399","doi":"https://doi.org/10.1007/978-3-540-30551-4_11","mag":"1588722399"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30551-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_11","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/A5067613275","display_name":"Sang Won Bae","orcid":"https://orcid.org/0000-0002-8802-4247"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sang Won Bae","raw_affiliation_strings":["Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108347878","display_name":"Kyung\u2010Yong Chwa","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kyung-Yong Chwa","raw_affiliation_strings":["Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Computer Science, Department of EECS, Korea Advanced Institute of Science and Technology, Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0761,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86725664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"112"},"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/T12698","display_name":"3D Modeling in Geospatial Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9918782711029053},{"id":"https://openalex.org/keywords/weighted-voronoi-diagram","display_name":"Weighted Voronoi diagram","score":0.883886992931366},{"id":"https://openalex.org/keywords/power-diagram","display_name":"Power diagram","score":0.789543628692627},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.7424052953720093},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6743611097335815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6200248003005981},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5844411849975586},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5667548775672913},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.5650608539581299},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49664217233657837},{"id":"https://openalex.org/keywords/centroidal-voronoi-tessellation","display_name":"Centroidal Voronoi tessellation","score":0.49259334802627563},{"id":"https://openalex.org/keywords/diagram","display_name":"Diagram","score":0.4733198583126068},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4539787471294403},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.44378215074539185},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33428505063056946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32883667945861816},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32191699743270874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28428953886032104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.270561158657074},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.21000632643699646},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13833773136138916},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12648794054985046},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.08858326077461243}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.9918782711029053},{"id":"https://openalex.org/C20468658","wikidata":"https://www.wikidata.org/wiki/Q17130624","display_name":"Weighted Voronoi diagram","level":3,"score":0.883886992931366},{"id":"https://openalex.org/C20573064","wikidata":"https://www.wikidata.org/wiki/Q13410436","display_name":"Power diagram","level":3,"score":0.789543628692627},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.7424052953720093},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6743611097335815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6200248003005981},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5844411849975586},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5667548775672913},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.5650608539581299},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49664217233657837},{"id":"https://openalex.org/C205672865","wikidata":"https://www.wikidata.org/wiki/Q5062961","display_name":"Centroidal Voronoi tessellation","level":3,"score":0.49259334802627563},{"id":"https://openalex.org/C186399060","wikidata":"https://www.wikidata.org/wiki/Q959962","display_name":"Diagram","level":2,"score":0.4733198583126068},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4539787471294403},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.44378215074539185},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33428505063056946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32883667945861816},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32191699743270874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28428953886032104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.270561158657074},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.21000632643699646},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13833773136138916},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12648794054985046},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.08858326077461243},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-30551-4_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30551-4_11","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1481075119","https://openalex.org/W1987221468","https://openalex.org/W1989723858","https://openalex.org/W1991643391","https://openalex.org/W2009894253","https://openalex.org/W2011185265","https://openalex.org/W2041551783","https://openalex.org/W2065541356","https://openalex.org/W2120621946","https://openalex.org/W2149906774","https://openalex.org/W2242543231","https://openalex.org/W3145128584","https://openalex.org/W4210881201"],"related_works":["https://openalex.org/W2015548030","https://openalex.org/W2739428663","https://openalex.org/W2383087774","https://openalex.org/W889844791","https://openalex.org/W2351580801","https://openalex.org/W2083174473","https://openalex.org/W2142458133","https://openalex.org/W2345773879","https://openalex.org/W2165323058","https://openalex.org/W2189603398"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}