{"id":"https://openalex.org/W2067084940","doi":"https://doi.org/10.1016/s0925-7721(99)00037-1","title":"The greedy triangulation can be computed from the Delaunay triangulation in linear time","display_name":"The greedy triangulation can be computed from the Delaunay triangulation in linear time","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2067084940","doi":"https://doi.org/10.1016/s0925-7721(99)00037-1","mag":"2067084940"},"language":"en","primary_location":{"id":"doi:10.1016/s0925-7721(99)00037-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0925-7721(99)00037-1","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"},"type":"article","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/A5005407145","display_name":"Christos Levcopoulos","orcid":"https://orcid.org/0000-0003-0983-7862"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Christos Levcopoulos","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009999441","display_name":"Drago Krznaric","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Drago Krznaric","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118 S-221 00 Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005407145"],"corresponding_institution_ids":["https://openalex.org/I187531555"],"apc_list":{"value":2180,"currency":"USD","value_usd":2180},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.23492823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"14","issue":"4","first_page":"197","last_page":"220"},"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.9948999881744385,"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.9948999881744385,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9505000114440918,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13854","display_name":"Historical Geography and Cartography","score":0.9319000244140625,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.9763571619987488},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.9434283971786499},{"id":"https://openalex.org/keywords/constrained-delaunay-triangulation","display_name":"Constrained Delaunay triangulation","score":0.9160230159759521},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.8456496596336365},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.7850139141082764},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.709405779838562},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.6470587253570557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6438339948654175},{"id":"https://openalex.org/keywords/surface-triangulation","display_name":"Surface triangulation","score":0.5839134454727173},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.5169314742088318},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4652152359485626},{"id":"https://openalex.org/keywords/chews-second-algorithm","display_name":"Chew's second algorithm","score":0.44103673100471497},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42760467529296875},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4200516939163208},{"id":"https://openalex.org/keywords/rupperts-algorithm","display_name":"Ruppert's algorithm","score":0.4141649305820465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.378276526927948},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.214176207780838}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.9763571619987488},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.9434283971786499},{"id":"https://openalex.org/C128321387","wikidata":"https://www.wikidata.org/wiki/Q5164356","display_name":"Constrained Delaunay triangulation","level":3,"score":0.9160230159759521},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.8456496596336365},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.7850139141082764},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.709405779838562},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6470587253570557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6438339948654175},{"id":"https://openalex.org/C50285192","wikidata":"https://www.wikidata.org/wiki/Q15713605","display_name":"Surface triangulation","level":4,"score":0.5839134454727173},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.5169314742088318},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4652152359485626},{"id":"https://openalex.org/C183342303","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Chew's second algorithm","level":4,"score":0.44103673100471497},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42760467529296875},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4200516939163208},{"id":"https://openalex.org/C99886907","wikidata":"https://www.wikidata.org/wiki/Q105742691","display_name":"Ruppert's algorithm","level":4,"score":0.4141649305820465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.378276526927948},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.214176207780838}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0925-7721(99)00037-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0925-7721(99)00037-1","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Geometry","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2359979928","https://openalex.org/W2172589357","https://openalex.org/W149465645","https://openalex.org/W2001351033","https://openalex.org/W2354502962","https://openalex.org/W2028864160","https://openalex.org/W4254406543","https://openalex.org/W1979362696","https://openalex.org/W2611154072","https://openalex.org/W4232052003"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}