{"id":"https://openalex.org/W2029148982","doi":"https://doi.org/10.1080/2151237x.2006.10129214","title":"A High-Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves","display_name":"A High-Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2029148982","doi":"https://doi.org/10.1080/2151237x.2006.10129214","mag":"2029148982"},"language":"en","primary_location":{"id":"doi:10.1080/2151237x.2006.10129214","is_oa":false,"landing_page_url":"https://doi.org/10.1080/2151237x.2006.10129214","pdf_url":null,"source":{"id":"https://openalex.org/S4210240212","display_name":"Journal of Graphics Tools","issn_l":"1086-7651","issn":["1086-7651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graphics Tools","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/A5015728413","display_name":"YingLiang Ma","orcid":"https://orcid.org/0000-0001-5770-5843"},"institutions":[{"id":"https://openalex.org/I138801177","display_name":"University of Ulster","ror":"https://ror.org/01yp9g959","country_code":"GB","type":"education","lineage":["https://openalex.org/I138801177"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"YingLiang Ma","raw_affiliation_strings":["University of Ulster"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ulster","institution_ids":["https://openalex.org/I138801177"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113496570","display_name":"W.T. Hewitt","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"W. T. Hewitt","raw_affiliation_strings":["University of Manchester","University of Manchester\u00a0"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manchester","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University of Manchester\u00a0","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042880953","display_name":"Martin Turner","orcid":"https://orcid.org/0000-0003-0117-8049"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Turner","raw_affiliation_strings":["University of Manchester","University of Manchester\u00a0"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manchester","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University of Manchester\u00a0","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4249,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65718719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"1","first_page":"37","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T12549","display_name":"Image and Object Detection Techniques","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9848999977111816,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.6754707098007202},{"id":"https://openalex.org/keywords/b\u00e9zier-curve","display_name":"B\u00e9zier curve","score":0.6521115899085999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5753774046897888},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5629460215568542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5202940106391907},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4435272216796875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3833463788032532},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35656219720840454},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32702407240867615},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2856168746948242},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.19243010878562927},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11076760292053223}],"concepts":[{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.6754707098007202},{"id":"https://openalex.org/C206423108","wikidata":"https://www.wikidata.org/wiki/Q214728","display_name":"B\u00e9zier curve","level":2,"score":0.6521115899085999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5753774046897888},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5629460215568542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5202940106391907},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4435272216796875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3833463788032532},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35656219720840454},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32702407240867615},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2856168746948242},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.19243010878562927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11076760292053223},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1080/2151237x.2006.10129214","is_oa":false,"landing_page_url":"https://doi.org/10.1080/2151237x.2006.10129214","pdf_url":null,"source":{"id":"https://openalex.org/S4210240212","display_name":"Journal of Graphics Tools","issn_l":"1086-7651","issn":["1086-7651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graphics Tools","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/b09c2277-d81c-42bf-afba-08e953a95ed5","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/b09c2277-d81c-42bf-afba-08e953a95ed5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ma, Y, Turner, M J & Hewitt, W T 2006, 'A High Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves', Journal of Graphical Tools, vol. 11, no. 1, pp. 37-50. https://doi.org/10.1080/2151237X.2006.10129214","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/b09c2277-d81c-42bf-afba-08e953a95ed5","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/a-high-performance-method-for-calculating-the-minimum-distance-between-two-2d-and-3d-nurbs-curves(b09c2277-d81c-42bf-afba-08e953a95ed5).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ma, Y, Turner, M J & Hewitt, W T 2006, 'A High Performance Method for Calculating the Minimum Distance between Two 2D and 3D NURBS Curves', Journal of Graphical Tools, vol. 11, no. 1, pp. 37-50. https://doi.org/10.1080/2151237X.2006.10129214","raw_type":"article"},{"id":"pmh:oai:ueaeprints.uea.ac.uk:90417","is_oa":false,"landing_page_url":"https://ueaeprints.uea.ac.uk/id/eprint/90417/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400384","display_name":"UEA Digital Repository (University of East Anglia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1118541","host_organization_name":"University of East Anglia","host_organization_lineage":["https://openalex.org/I1118541"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1548879090","https://openalex.org/W1987017430","https://openalex.org/W1996984003","https://openalex.org/W2000038876","https://openalex.org/W2041180141","https://openalex.org/W2080981703","https://openalex.org/W2156565283","https://openalex.org/W2158405241"],"related_works":["https://openalex.org/W2873344491","https://openalex.org/W2389575128","https://openalex.org/W2313232378","https://openalex.org/W1903555144","https://openalex.org/W2357871848","https://openalex.org/W2165642858","https://openalex.org/W2372035321","https://openalex.org/W2956876562","https://openalex.org/W3127061749","https://openalex.org/W2355895214"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,39,49,76,109],"fast,":[3],"accurate,":[4],"and":[5,16],"robust":[6],"method":[7,85,134],"to":[8,62,94,117,135],"compute":[9],"the":[10,29,71,96,119,131],"minimum":[11,99,106,121],"distance":[12],"between":[13,75,108],"two":[14],"2D":[15],"3D":[17],"NURBS":[18,30],"curves.":[19,80],"This":[20],"is":[21,68,86,125,141],"carried":[22],"out":[23],"by":[24,102,127],"first":[25],"decomposing":[26],"both":[27],"of":[28,41,59,78,111,130],"curves":[31],"into":[32],"their":[33],"piecewise-B\u00e9zier":[34],"forms.":[35],"Candidate":[36],"pairs,":[37,44],"as":[38],"subset":[40],"all":[42,89,104],"possible":[43],"are":[45,115],"extracted":[46],"based":[47,69],"on":[48,70,88],"two-level":[50],"selection":[51,55,67],"process.":[52],"The":[53,65,123],"first-level":[54],"uses":[56],"upper-lower":[57],"bounds":[58],"B\u00e9zier":[60,79,112],"subcurves":[61],"remove":[63],"pairs.":[64],"second-level":[66],"spatial":[72],"relationship":[73],"test":[74],"pair":[77,110],"An":[81],"iterative":[82],"multidimensional":[83,132],"Newton-Raphson":[84,133],"applied":[87],"candidate":[90],"pairs":[91],"in":[92],"order":[93],"calculate":[95],"approximate":[97],"local":[98,105],"distances.":[100],"Finally,":[101],"comparing":[103],"distances":[107],"subcurves,":[113],"we":[114],"able":[116],"find":[118],"global":[120],"distance.":[122],"accuracy":[124],"improved":[126],"further":[128],"use":[129],"give":[136],"high":[137],"accuracy.":[138],"Source":[139],"code":[140],"available":[142],"online.":[143]},"counts_by_year":[{"year":2019,"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"}