Rational Bezier Guarding
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Khanteimouri, P. | |
dc.contributor.author | Mandad, M. | |
dc.contributor.author | Campen, M. | |
dc.date.accessioned | 2023-02-17T11:32:37Z | - |
dc.date.available | 2023-02-17T11:32:37Z | - |
dc.date.issued | 2022 | |
dc.identifier.issn | 0167-7055 | |
dc.identifier.uri | http://osnascholar.ub.uni-osnabrueck.de/handle/unios/65321 | - |
dc.description.abstract | We present a reliable method to generate planar meshes of nonlinear rational triangular elements. The elements are guaranteed to be valid, i.e. defined by injective rational functions. The mesh is guaranteed to conform exactly, without geometric error, to arbitrary rational domain boundary and feature curves. The method generalizes the recent Bezier Guarding technique, which is applicable only to polynomial curves and elements. This generalization enables the accurate handling of practically important cases involving, for instance, circular or elliptic arcs and NURBS curves, which cannot be matched by polynomial elements. Furthermore, although many practical scenarios are concerned with rational functions of quadratic and cubic degree only, our method is fully general and supports arbitrary degree. We demonstrate the method on a variety of test cases. | |
dc.description.sponsorship | Deutsche Forschungsgemeinschaft (DFG) [451286978]; Projekt DEAL; The authors thank the anonymous reviewers for very valuable remarks. This work was funded by the Deutsche Forschungsgemeinschaft (DFG) -451286978. Open access funding enabled and organized by Projekt DEAL. | |
dc.language.iso | en | |
dc.publisher | WILEY | |
dc.relation.ispartof | COMPUTER GRAPHICS FORUM | |
dc.subject | 3D | |
dc.subject | Computer Science | |
dc.subject | Computer Science, Software Engineering | |
dc.subject | CURVED MESHES | |
dc.subject | MESH GENERATION | |
dc.subject | QUALITY | |
dc.title | Rational Bezier Guarding | |
dc.type | journal article | |
dc.identifier.doi | 10.1111/cgf.14605 | |
dc.identifier.isi | ISI:000864660300009 | |
dc.description.volume | 41 | |
dc.description.issue | 5 | |
dc.description.startpage | 89 | |
dc.description.endpage | 99 | |
dc.contributor.orcid | 0000-0003-2340-3462 | |
dc.contributor.orcid | 0000-0001-7849-3077 | |
dc.identifier.eissn | 1467-8659 | |
dc.publisher.place | 111 RIVER ST, HOBOKEN 07030-5774, NJ USA | |
dcterms.isPartOf.abbreviation | Comput. Graph. Forum | |
dcterms.oaStatus | hybrid | |
local.import.remains | affiliations : University Osnabruck | |
local.import.remains | web-of-science-index : Science Citation Index Expanded (SCI-EXPANDED) | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.orcid | 0000-0003-2340-3462 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | CaMa281 | - |
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 07.06.2024