Sökning: id:"swepub:oai:DiVA.org:ltu-23772" >
The problem of comp...
The problem of computing an obstacle-avoiding minimum variation B-spline
-
- Berglund, Tomas (författare)
- Luleå tekniska universitet,EISLAB
-
- Jonsson, Håkan (författare)
- Luleå tekniska universitet,Datavetenskap
-
- Söderkvist, Inge (författare)
- Luleå tekniska universitet,Matematiska vetenskaper
-
(creator_code:org_t)
- Luleå : Luleå tekniska universitet, 2003
- Engelska.
-
Serie: Teknisk rapport / Luleå tekniska universitet, 1402-1536 ; 2003:06
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- We study the problem of computing a planar curve restricted to lie between two given polygonal chains such that the integral of the square of arc- length derivative of curvature along the curve is minimized. We introduce the Minimum Variation B-spline problem which is a linearly constrained optimization problem over curves defined by B-spline functions only. An empirical investigation indicates that this problem has one unique solution among all uniform quartic B-spline functions. Furthermore, we prove that, for any B-spline function, the convexity properties of the problem are preserved subject to a scaling and translation of the knot sequence defining the B-spline.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Scientific Computing
- Teknisk-vetenskapliga beräkningar
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- vet (ämneskategori)
- rap (ämneskategori)