default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHartmut Prautzsch
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j31]Andreas Müller
, Hartmut Prautzsch:
Obituary. Comput. Aided Geom. Des. 96: 102114 (2022)
2010 – 2019
- 2019
- [j30]Huining Meng, Hartmut Prautzsch:
Mixed honeycomb pushing refinement. Comput. Aided Geom. Des. 75 (2019) - 2018
- [j29]Robert E. Barnhill, Hartmut Prautzsch:
In memoriam Wolfgang Boehm. Comput. Aided Geom. Des. 67: iii-viii (2018) - 2014
- [j28]Qi Chen, Hartmut Prautzsch:
General triangular midpoint subdivision. Comput. Aided Geom. Des. 31(7-8): 475-485 (2014) - 2012
- [i2]Qi Chen, Hartmut Prautzsch:
General Midpoint Subdivision. CoRR abs/1208.3794 (2012) - 2011
- [j27]Hartmut Prautzsch, Qi Chen:
Analyzing midpoint subdivision. Comput. Aided Geom. Des. 28(7): 407-419 (2011) - 2010
- [j26]Hartmut Prautzsch:
Be ye transformed by the renewing of your mind. Comput. Aided Des. 42(3): 266 (2010)
2000 – 2009
- 2009
- [e1]Hartmut Prautzsch, Alfred A. Schmitt, Jan Bender, Matthias Teschner:
Proceedings of the Sixth Workshop on Virtual Reality Interactions and Physical Simulations, VRIPHYS 2009, Karlsruhe, Germany, 2009. Eurographics Association 2009, ISBN 978-3-905673-73-9 [contents] - [i1]Hartmut Prautzsch, Qi Chen:
Analyzing Midpoint Subdivision. CoRR abs/0911.5157 (2009) - 2007
- [j25]B. Klimmek, Hartmut Prautzsch, N. Vahrenkamp:
Shadow metamorphosis. Computing 79(2-4): 325-335 (2007) - 2006
- [j24]Hartmut Prautzsch, Georg Umlauf:
Parametrizations for triangular Gk spline surfaces of low degree. ACM Trans. Graph. 25(4): 1281-1293 (2006) - [c6]Hao Li, Raphael Straub, Hartmut Prautzsch:
Structured Light Based Reconstruction under Local Spatial Coherence Assumption. 3DPVT 2006: 575-582 - 2002
- [c5]Lars Linsen, Hartmut Prautzsch:
Fan Clouds - An Alternative to Meshes. Theoretical Foundations of Computer Vision 2002: 39-57 - [p3]Wolfgang Böhm, Hartmut Prautzsch:
Geometric Fundamentals. Handbook of Computer Aided Geometric Design 2002: 23-42 - [p2]Hartmut Prautzsch, Wolfgang Böhm:
Box Splines. Handbook of Computer Aided Geometric Design 2002: 255-282 - 2001
- [c4]Lars Linsen, Hartmut Prautzsch:
Local Versus Global Triangulations. Eurographics (Short Presentations) 2001 - 2000
- [j23]Hartmut Prautzsch, Georg Umlauf:
A G1 and a G2 subdivision Scheme for triangular Nets. Int. J. Shape Model. 6(1): 21-36 (2000)
1990 – 1999
- 1999
- [j22]Hartmut Prautzsch, Ulrich Reif:
Degree estimates for Ck-piecewise polynomial subdivision surfaces. Adv. Comput. Math. 10(2): 209-217 (1999) - [j21]Claudia Bangert, Hartmut Prautzsch:
Quadric splines. Comput. Aided Geom. Des. 16(6): 497-515 (1999) - [j20]Claudia Bangert, Hartmut Prautzsch:
A geometric criterion for the convexity of Powell-Sabin interpolants and its multivariate generalization. Comput. Aided Geom. Des. 16(6): 529-538 (1999) - [j19]Hanspeter Bieri, Hartmut Prautzsch:
Preface. Comput. Aided Geom. Des. 16(7): 579-581 (1999) - 1998
- [j18]Hartmut Prautzsch:
Smoothness of subdivision surfaces at extraordinary points. Adv. Comput. Math. 9(3-4): 377-389 (1998) - [c3]Hartmut Prautzsch, Georg Umlauf:
Improved Triangular Subdivision Schemes. Computer Graphics International 1998: 626-632 - 1997
- [j17]Hartmut Prautzsch:
Freeform splines. Comput. Aided Geom. Des. 14(3): 201-206 (1997) - [j16]Marco Paluszny, Hartmut Prautzsch, Martin Schäfer:
A geometric look at corner cutting. Comput. Aided Geom. Des. 14(5): 421-447 (1997) - [j15]Claudia Bangert, Hartmut Prautzsch:
Circle and sphere as rational splines. Neural Parallel Sci. Comput. 5(1-2): 153-162 (1997) - 1996
- [j14]Wilfried Trump, Hartmut Prautzsch:
Arbitrarily high degree elevation of Bézier representations. Comput. Aided Geom. Des. 13(5): 387-398 (1996) - [c2]Hartmut Prautzsch, Georg Umlauf:
A G2-Subdivision Algorithm. Geometric Modelling 1996: 217-224 - [p1]Hartmut Prautzsch:
Multivariate Splines with Convex B-Patch Control Nets are Convex. Advanced Course on FAIRSHAPE 1996: 153-159 - 1994
- [b3]Wolfgang Böhm, Hartmut Prautzsch:
Geometric concepts for geometric design. A K Peters 1994, ISBN 978-1-56881-004-1, pp. I-XVII, 1-393 - [j13]Hartmut Prautzsch, Leif Kobbelt:
Convergence of subdivision and degree elevation. Adv. Comput. Math. 2(1): 143-154 (1994) - [j12]Hartmut Prautzsch, Bruce R. Piper:
A fast algorithm to raise the degree of spline curves : Computer aided geometric design 8 (4) (October 1991) 253-265. Comput. Aided Geom. Des. 11(2): 229 (1994) - [j11]Hartmut Prautzsch:
On Degen's conjecture. Comput. Aided Geom. Des. 11(5): 593-596 (1994) - 1993
- [b2]Wolfgang Böhm, Hartmut Prautzsch:
Numerical methods. Vieweg 1993, ISBN 978-3-528-06350-4, pp. I-X, 1-186 - 1992
- [j10]Hartmut Prautzsch, Timothy Gallagher:
Is there a geometric variation diminishing property for B-spline or Bézier surfaces? Comput. Aided Geom. Des. 9(2): 119-124 (1992) - [c1]Hartmut Prautzsch:
Approximate Cr- Blending with Tensor Product Polynomials. Geometric Modelling 1992: 251-258 - 1991
- [j9]Hartmut Prautzsch, Bruce R. Piper:
A fast algorithm to raise the degree of spline curves. Comput. Aided Geom. Des. 8(4): 253-265 (1991)
1980 – 1989
- 1989
- [j8]Hartmut Prautzsch:
Curve and Surface Fitting: An Introduction (Peter Lancaster and Kestutis Šalkauskas). SIAM Rev. 31(1): 155-157 (1989) - [j7]Hartmut Prautzsch:
A round trip to B-splines via de Casteljau. ACM Trans. Graph. 8(3): 243-254 (1989) - 1987
- [j6]Hartmut Prautzsch, Charles A. Micchelli:
Computing curves invariant under halving. Comput. Aided Geom. Des. 4(1-2): 133-140 (1987) - [j5]Charles A. Micchelli, Hartmut Prautzsch:
Computing surfaces invariant under subdivision. Comput. Aided Geom. Des. 4(4): 321-328 (1987) - 1985
- [j4]Hartmut Prautzsch:
Generalized subdivision and convergence. Comput. Aided Geom. Des. 2(1-3): 69-75 (1985) - [j3]Hartmut Prautzsch:
Letter to the editor. Comput. Aided Geom. Des. 2(4): 329 (1985) - 1984
- [b1]Hartmut Prautzsch:
Unterteilungsalgorithmen für multivariate Splines, ein geometrischer Zugang. Braunschweig University of Technology, Germany, 1984, pp. 1-84 - [j2]Hartmut Prautzsch:
A short proof of the Oslo algorithm. Comput. Aided Geom. Des. 1(1): 95-96 (1984) - [j1]Hartmut Prautzsch:
Degree elevation of B-spline curves. Comput. Aided Geom. Des. 1(2): 193-198 (1984)
Coauthor Index
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-10-09 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
