Paul Dierckx - RankMe

16 papers C 1Journal 13Unranked 1

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Quasi-hierarchical Powell-Sabin B-splines. Comput. Aided Geom. Des. Hendrik Speleers, Paul Dierckx, Stefan Vandewalle
2008	—	`conf`	On the Local Approximation Power of Quasi-Hierarchical Powell-Sabin Splines. MMCS Hendrik Speleers, Paul Dierckx, Stefan Vandewalle
2007	J	`jnl`	Weight control for modelling with NURPS surfaces. Comput. Aided Geom. Des. Hendrik Speleers, Paul Dierckx, Stefan Vandewalle
2006	J	`jnl`	Local subdivision of Powell-Sabin splines. Comput. Aided Geom. Des. Hendrik Speleers, Paul Dierckx, Stefan Vandewalle
2004	J	`jnl`	Automatic construction of control triangles for subdivided Powell-Sabin splines. Comput. Aided Geom. Des. Evelyne Vanraes, Joris Windmolders, Adhemar Bultheel, Paul Dierckx
2002	C	`conf`	Dyadic and \sqrt 3 - subdivision for Uniform Powell-Sabin Splines IV Evelyne Vanraes, Joris Windmolders, Adhemar Bultheel, Paul Dierckx
1999	J	`jnl`	Subdivision of uniform Powell-Sabin splines. Comput. Aided Geom. Des. Joris Windmolders, Paul Dierckx
1997	J	`jnl`	On calculating normalized Powell-Sabin B-splines. Comput. Aided Geom. Des. Paul Dierckx
1996	—	`book`	Curve and surface fitting with splines. Paul Dierckx
1996	J	`jnl`	Smoothing scattered data with a monotone Powell-Sabin spline surface. Numer. Algorithms Karin Willemans, Paul Dierckx
1995	J	`jnl`	Nonnegative surface fitting with Powell-Sabin splines. Numer. Algorithms Karin Willemans, Paul Dierckx
1989	J	`jnl`	Generating the Bézier points of a -spline curve. Comput. Aided Geom. Des. Paul Dierckx, Bart Tytgat
1984	J	`jnl`	Algorithms for smoothing data on the sphere with tensor product splines. Computing Paul Dierckx
1982	J	`jnl`	Algorithms for smoothing data with periodic and parametric splines. Comput. Graph. Image Process. Paul Dierckx
1982	J	`jnl`	Algorithms for smoothing data with periodic and parametric splines. Comput. Graph. Image Process. Paul Dierckx
1980	J	`jnl`	Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints. Computing Paul Dierckx