{"doi":"10.1006/jagm.1995.1021","title":"A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation","abstract":null,"journal":"Journal of Algorithms","year":1995,"id":23373,"datarank":27.1493748485462,"base_score":6.511745329644728,"endowment":6.511745329644728,"self_citation_contribution":0.9767617994467094,"citation_network_contribution":26.17261304909949,"self_endowment_contribution":0.9767617994467094,"citer_contribution":26.17261304909949,"corpus_percentile":null,"corpus_rank":null,"citation_count":672,"citer_count":200,"citers_with_citation_signal":200,"citers_with_endowment":200,"datacite_reuse_total":2,"is_dataset":false,"is_dataset_confidence":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":143724,"name":"J. Ruppert","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":6.511745329644728,"endowment":6.511745329644728,"datacite_reuse_total":2,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W1967337063","authors":[],"funders":[],"total_grants":0,"fwci":5.6263,"citation_percentile":0.96363636,"influential_citations":79,"citation_trend":[{"year":2012,"count":30},{"year":2013,"count":28},{"year":2014,"count":29},{"year":2015,"count":31},{"year":2016,"count":18},{"year":2017,"count":16},{"year":2018,"count":21},{"year":2019,"count":21},{"year":2020,"count":18},{"year":2021,"count":27},{"year":2022,"count":11},{"year":2023,"count":9},{"year":2024,"count":10},{"year":2025,"count":12},{"year":2026,"count":8}],"oa_status":"closed","license":"https://www.elsevier.com/tdm/userlicense/1.0/","oa_locations":[{"url":"https://api.elsevier.com/content/article/PII:S0196677485710218?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0196677485710218?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1006/jagm.1995.1021","host_type":"journal"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.2542","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9007","host_type":""}],"fields_of_study":["Computational Geometry and Mesh Generation","Computer Graphics and Visualization Techniques","Remote Sensing and LiDAR Applications","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Delaunay triangulation","Algorithm","Mathematics","Planar","Constant (computer programming)","Chew's second algorithm","Ruppert's algorithm","Bounded function","Combinatorics","Simple (philosophy)","Aspect ratio (aeronautics)","Computational geometry","Constrained Delaunay triangulation","Computer science","Computer graphics (images)","Mathematical analysis","Physics"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.socg.2026.93","title":"Simplicial Approximation to CW Complexes with Spherical Delaunay Triangulations","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.socg.2026.40","title":"Computing the Intrinsic Delaunay Triangulation of a Closed Polyhedral Surface","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T19:18:26.841387Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}