Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding intersections of B-spline represented geometries using recursive subdivision techniques

From MaRDI portal
Publication:1080639
Jump to:navigation, search

DOI10.1016/0167-8396(85)90024-XzbMath0599.65096OpenAlexW1981973594MaRDI QIDQ1080639

Tor Dokken

Publication date: 1985

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(85)90024-x

zbMATH Keywords

subdivisioncurvessurfacesintersectionsB-splineextremal pointsclosest points


Mathematics Subject Classification ID

Numerical computation using splines (65D07) Multidimensional problems (41A63) Surfaces in Euclidean and related spaces (53A05) Spline approximation (41A15) Curves in Euclidean and related spaces (53A04) Graphical methods in numerical analysis (65S05)


Related Items

A line/trimmed NURBS surface intersection algorithm using matrix representations, A unified algorithm for finding the intersection curve of surfaces, Loop detection in surface patch intersections, Granular element method for computational particle mechanics, Computation of the solutions of nonlinear polynomial systems, Some identities for product and degree raising of splines, Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques



Cites Work

  • Bounds on a polynomial
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1080639&oldid=13105263"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki