Optimal intersection curves for surfaces (Q2666464): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2021/9945984 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3195282923 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection curves of hypersurfaces in \(\mathbb R^4\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification and resolution of critical cases in Grandine and Klein's topology determination using a perturbation method / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:31, 27 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal intersection curves for surfaces |
scientific article |
Statements
Optimal intersection curves for surfaces (English)
0 references
22 November 2021
0 references
Summary: In this article, an algorithm has been established to approximate parametric-parametric, explicit-implicit, and explicit-explicit surface intersection. Foremost, it extracts the characteristic points (boundary and turning points) from the sequence of intersection points and fits an optimal cubic spline curve to these points. Moreover, this paper utilizes genetic algorithm (GA) for optimization of shape parameters in the portrayal of cubic spline so that the error is minimal. The proposed algorithm is demonstrated with different types of surfaces to analyze its robustness and proficiency. In the end, all illustrations show the effectiveness of the algorithm which makes it more influential to resolve all complexities arises during intersection with a minimal error.
0 references