Representation of NURBS surfaces by Controlled Iterated Functions System automata. Issue 2 (December 2019)

• Record Type: Journal Article
• Authors: Morlet, Lucas; Gentil, Christian; Lanquetin, Sandrine; Neveu, Marc; Baril, Jean-Luc
• Is Part Of: Computers & graphics. Issue 2(2019)
• Publication Date: 2019-12
• Subjects: Geometric modeling -- Iterative modeling -- Non-Uniform Rational B-Splines -- Iterated Functions Systems -- CIFS automata; Computer graphics -- Periodicals; Computer graphics; Periodicals; 006.605
• DOI: 10.1016/j.cagx.2019.100006
• Languages: English
• ISSNs: 2590-1486

Abstract

Highlights: Our global project is a CAGD-system based on CIFS-automata which are an extension of Iterative Functions Systems (IFS). This model can already handle several types of surfaces with the same unique formalism: Bézier, uniform B-Splines, fractals, subdivision surfaces. The purpose of this article is to integrate NURBS surfaces, which are the main representation in CAGD, in this model. Once integrated, NURBS can interact with the other types of surfaces thanks to common tools intrisic to our formalism. Graphical abstract: Abstract: Iterated Function Systems (IFS) are a standard tool to generate fractal shapes. In a more general way, they can represent most of standard surfaces like Bézier or B-Spline surfaces known as self-similar surfaces. Controlled Iterated Function Systems (CIFS) are an extension of IFS based on automata. CIFS are basically multi-states IFS, they can handle all IFS shapes but can also manage multi self-similar shapes. For example CIFS can describe subdivision surfaces around extraordinary vertices whereas IFS cannot. Having a common CIFS formalism facilitates the development of generic methods to manage interactions (junctions, differences...) between objects of different natures. This work focuses on a CIFS approach of Non-Uniform Rational B-Splines (NURBS) which are the main used representation of surfaces in CAGD systems. By analyzing the recursive generating process of basis functions, we prove the stationarity of NURBS computation. This implies that NURBS can be represented as a finite automaton: a CIFS. Subdivision transformations implied in the generating process are directly deduced from blossoming formulation and are expressed as a function of the initial nodal vector. We provide a method to construct the CIFS automata for NURBS of any-degree. Then NURBS-surfaces automata are deduced using a "tensor-product" of NURBS automata. This new representation of NURBS allows us to build a bridge between them and other surfaces already represented in CIFS formalism: fractals and subdivision surfaces.