![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ulrich Reif
Person information
- affiliation: TU Darmstadt, Germany
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j36]Tom Lyche, Knut Mørken, Ulrich Reif:
On the condition of cubic B-splines. J. Approx. Theory 289: 105883 (2023) - [i6]Ulrich Reif:
Sobolev Regularity of Isogeometric Finite Element Spaces with Degenerate Geometry Map. CoRR abs/2306.13494 (2023) - [i5]Thomas Mejstrik, Ulrich Reif:
Hybrid approach to the joint spectral radius computation. CoRR abs/2308.05244 (2023) - 2022
- [j35]Ba-Duong Chu, Florian Martin, Ulrich Reif
:
Stabilization of spline bases by extension. Adv. Comput. Math. 48(3): 23 (2022) - [j34]Benjamin Marussig
, Ulrich Reif:
Surface patches with rounded corners. Comput. Aided Geom. Des. 97: 102134 (2022) - [i4]Benjamin Marussig, Ulrich Reif:
Surface Patches with Rounded Corners. CoRR abs/2203.12345 (2022) - 2021
- [j33]Ulrich Reif, Andreas Weinmann
:
Clothoid fitting and geometric Hermite subdivision. Adv. Comput. Math. 47(4): 50 (2021) - 2020
- [i3]Ulrich Reif, Andreas Weinmann:
Clothoid Fitting and Geometric Hermite Subdivision. CoRR abs/2004.07495 (2020) - [i2]Florian Martin, Ulrich Reif:
Trimmed Spline Surfaces with Accurate Boundary Control. CoRR abs/2009.02480 (2020)
2010 – 2019
- 2019
- [j32]Ulrich Reif, Malcolm A. Sabin:
Old problems and new challenges in subdivision. J. Comput. Appl. Math. 349: 523-531 (2019) - [i1]Thomas A. Grandine, Jörg Peters, Ulrich Reif:
Interactive Design and Simulation (Dagstuhl Seminar 19512). Dagstuhl Reports 9(12): 115-134 (2019) - 2016
- [j31]Christian Apprich, Klaus Höllig, Jörg Hörner, Ulrich Reif:
Collocation with WEB-Splines. Adv. Comput. Math. 42(4): 823-842 (2016) - [j30]Jan Hakenberg, Ulrich Reif:
On the volume of sets bounded by refinable functions. Appl. Math. Comput. 272: 2-19 (2016) - 2014
- [j29]Ulrich Reif, Nada Sissouno
:
Approximation with diversified B-splines. Comput. Aided Geom. Des. 31(7-8): 510-520 (2014) - [j28]Oleg Davydov, Jennifer Prasiswa, Ulrich Reif:
Two-stage approximation methods with extended B-splines. Math. Comput. 83(286): 809-833 (2014) - 2013
- [j27]Thomas J. Cashman, Kai Hormann
, Ulrich Reif:
Generalized Lane-Riesenfeld algorithms. Comput. Aided Geom. Des. 30(4): 398-409 (2013) - 2012
- [j26]Nicole Lehmann, Ulrich Reif:
Notes on the curvature tensor. Graph. Model. 74(6): 321-325 (2012) - [j25]Ulrich Reif:
Polynomial approximation on domains bounded by diffeomorphic images of graphs. J. Approx. Theory 164(7): 954-970 (2012) - 2010
- [j24]Andreas App, Ulrich Reif:
Piecewise Linear Orthogonal Approximation. SIAM J. Numer. Anal. 48(3): 840-856 (2010)
2000 – 2009
- 2009
- [j23]Bernhard Mößner, Ulrich Reif:
Error bounds for polynomial tensor product interpolation. Computing 86(2-3): 185-197 (2009) - 2008
- [b3]Jörg Peters, Ulrich Reif:
Subdivision Surfaces. Geometry and Computing 3, Springer 2008, ISBN 978-3-540-76405-2, pp. 1-204 - [j22]Bernhard Mößner, Ulrich Reif:
Stability of tensor product B-splines on domains. J. Approx. Theory 154(1): 1-19 (2008) - 2007
- [j21]Michael S. Floater, Atgeirr F. Rasmussen, Ulrich Reif:
Extrapolation methods for approximating arc length and surface area. Numer. Algorithms 44(3): 235-248 (2007) - [c1]Ulrich Reif:
An Appropriate Geometric Invariant for the C 2-Analysis of Subdivision Surfaces. IMA Conference on the Mathematics of Surfaces 2007: 364-377 - 2005
- [j20]Ulrich Reif, Karsten Große-Brauckmann:
Guest Editors' Note. Comput. Aided Geom. Des. 22(7): 571-572 (2005) - 2004
- [j19]Jörg Peters
, Ulrich Reif:
Shape characterization of subdivision surfaces--basic principles. Comput. Aided Geom. Des. 21: 585-599 (2004) - [j18]Kestutis Karciauskas, Jörg Peters
, Ulrich Reif:
Shape characterization of subdivision surfaces--case studies. Comput. Aided Geom. Des. 21: 601-614 (2004) - 2003
- [j17]Klaus Höllig, Ulrich Reif:
Nonuniform web-splines. Comput. Aided Geom. Des. 20(5): 277-294 (2003) - [j16]Ulrich Reif:
In memoriam Josef Hoschek. Comput. Aided Geom. Des. 20(8-9): 493-499 (2003) - 2002
- [j15]Klaus Höllig, Ulrich Reif, Joachim Wipper
:
Multigrid methods with web-splines. Numerische Mathematik 91(2): 237-255 (2002) - 2001
- [j14]Ulrich Reif, Peter Schröder:
Curvature integrability of subdivision surfaces. Adv. Comput. Math. 14(2): 157-174 (2001) - [j13]Klaus Höllig, Ulrich Reif, Joachim Wipper
:
Weighted Extended B-Spline Approximation of Dirichlet Problems. SIAM J. Numer. Anal. 39(2): 442-462 (2001) - 2000
- [j12]Ulrich Reif:
Best bounds on the approximation of polynomials and splines by their control structure. Comput. Aided Geom. Des. 17(6): 579-589 (2000)
1990 – 1999
- 1999
- [b2]Ulrich Reif:
Analyse und Konstruktion von Subdivisionsalgorithmen für Freiformflächen beliebiger Topologie. Berichte aus der Mathematik, Shaker 1999, ISBN 978-3-8265-4695-2, pp. I-III, 1-114 - [j11]Hartmut Prautzsch, Ulrich Reif:
Degree estimates for Ck-piecewise polynomial subdivision surfaces. Adv. Comput. Math. 10(2): 209-217 (1999) - [j10]Ulrich Reif:
On the local existence of the quadratic geometric Hermite interpolant. Comput. Aided Geom. Des. 16(3): 217-221 (1999) - [j9]David Lutterkort, Jörg Peters
, Ulrich Reif:
Polynomial degree reduction in the L2-norm equals best Euclidean approximation of Bézier coefficients. Comput. Aided Geom. Des. 16(7): 607-612 (1999) - 1998
- [j8]Jörg Peters
, Ulrich Reif:
The 42 equivalence classes of quadratic surfaces in affine n-space. Comput. Aided Geom. Des. 15(5): 459-473 (1998) - 1997
- [j7]H. Bohl, Ulrich Reif:
Degenerate Bézier patches with continuous curvature. Comput. Aided Geom. Des. 14(8): 749-761 (1997) - [j6]Ulrich Reif:
Uniform B-spline approximation in Sobolev spaces. Numer. Algorithms 15(1): 1-14 (1997) - [j5]Jörg Peters
, Ulrich Reif:
The Simplest Subdivision Scheme for Smoothing Polyhedra. ACM Trans. Graph. 16(4): 420-431 (1997) - [p1]Ulrich Reif:
Orthogonality Relations for Cardinal B-Splines over Bounded Intervals. Geometric Modeling 1997: 59-69 - 1995
- [j4]Ulrich Reif:
A unified approach to subdivision algorithms near extraordinary vertices. Comput. Aided Geom. Des. 12(2): 153-174 (1995) - [j3]Ulrich Reif:
Biquadratic G-spline surfaces. Comput. Aided Geom. Des. 12(2): 193-205 (1995) - [j2]Ulrich Reif:
A note on degenerate triangular Bézier patches. Comput. Aided Geom. Des. 12(5): 547-550 (1995) - [j1]Günter Aumann, Ulrich Reif, Klaus Spitzmüller:
A counterexample to a corollary of Kim et al.. Comput. Aided Geom. Des. 12(8): 853-855 (1995) - 1993
- [b1]Ulrich Reif:
Neue Aspekte in der Theorie der Freiformflächen beliebiger Topologie. University of Stuttgart, Germany, 1993, pp. 1-84
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint