default search action
Nira Dyn
Person information
- affiliation: Tel Aviv University, School of Mathematical Sciences, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]Hofit Ben-Zion Vardi, Nira Dyn, Nir Sharon
:
Hermite subdivision schemes for manifold-valued Hermite data. Comput. Aided Geom. Des. 111: 102342 (2024) - [i9]Nira Dyn, Nir Sharon:
Improving the convergence analysis of linear subdivision schemes. CoRR abs/2405.09414 (2024) - 2023
- [j52]Hofit Ben-Zion Vardi, Nira Dyn, Nir Sharon
Geometric Hermite interpolation in $\mathbb {R}^{n}$ by refinements. Adv. Comput. Math. 49(3): 38 (2023) - 2022
- [j51]Nira Dyn, Kai Hormann
Non-uniform interpolatory subdivision schemes with improved smoothness. Comput. Aided Geom. Des. 94: 102083 (2022) - [i8]Hofit Ben-Zion Vardi, Nira Dyn, Nir Sharon:
Geometric Hermite Interpolation in Rn by Refinements. CoRR abs/2203.02903 (2022) - [i7]Qusay Muzaffar, Nira Dyn, David Levin:
Interpolation of Set-Valued Functions. CoRR abs/2208.14929 (2022) - [i6]Maria Charina, Costanza Conti, Nira Dyn:
Multivariate compactly supported C∞ functions by subdivision. CoRR abs/2211.05677 (2022) - [i5]Elena E. Berdysheva, Nira Dyn, Elza M. Farkhi, Alona Mokhov:
Metric approximation of set-valued functions of bounded variation by integral operators. CoRR abs/2212.00439 (2022) - 2020
- [j50]Evgeny Lipovetsky, Nira Dyn:
Extending Editing Capabilities of Subdivision Schemes by Refinement of Point-Normal Pairs. Comput. Aided Des. 126: 102865 (2020) - [j49]Nira Dyn, Bert Jüttler
On the error in transfinite interpolation by low-rank functions. J. Approx. Theory 253: 105379 (2020) - [j48]Nira Dyn, Elza M. Farkhi
Approximation of 3D objects by piecewise linear geometric interpolants of their 1D cross-sections. J. Comput. Appl. Math. 368 (2020) - [j47]Costanza Conti, Nira Dyn, Lucia Romani
Convergence analysis of corner cutting algorithms refining nets of functions. Math. Comput. Simul. 176: 134-146 (2020) - [i4]Elena E. Berdysheva, Nira Dyn, Elza M. Farkhi, Alona Mokhov:
Metric Fourier approximation of set-valued functions of bounded variation. CoRR abs/2008.10340 (2020)
2010 – 2019
- 2019
- [j46]Evgeny Lipovetsky
C1 analysis of some 2D subdivision schemes refining point-normal pairs with the circle average. Comput. Aided Geom. Des. 69: 45-54 (2019) - [j45]Nira Dyn, Ron Goldman, David Levin:
High order smoothness of non-linear Lane-Riesenfeld algorithms in the functional setting. Comput. Aided Geom. Des. 71: 119-129 (2019) - [j44]Elena E. Berdysheva, Nira Dyn, Elza M. Farkhi
Metric approximation of set-valued functions of bounded variation. J. Comput. Appl. Math. 349: 251-264 (2019) - [i3]Maria Charina, Nira Dyn, Vladimir Yu. Protasov:
Analytic functions in shift-invariant spaces and analytic limits of level dependent subdivision. CoRR abs/1907.05658 (2019) - [i2]Evgeny Lipovetsky, Nira Dyn:
Extending editing capabilities of subdivision schemes by refinement of point-normal pairs. CoRR abs/1908.06154 (2019) - 2018
- [j43]Costanza Conti
Convergence and smoothness of tensor-product of two non-uniform linear subdivision schemes. Comput. Aided Geom. Des. 66: 16-18 (2018) - 2017
- [j42]Nira Dyn, Nir Sharon
Manifold-valued subdivision schemes based on geodesic inductive averaging. J. Comput. Appl. Math. 311: 54-67 (2017) - [j41]Nira Dyn, Nir Sharon
A global approach to the refinement of manifold data. Math. Comput. 86(303): 375-395 (2017) - 2016
- [j40]Evgeny Lipovetsky
A weighted binary average of point-normal pairs with application to subdivision schemes. Comput. Aided Geom. Des. 48: 36-48 (2016) - [i1]Evgeny Lipovetsky
A weighted binary average of point-normal pairs with application to subdivision schemes. CoRR abs/1608.04082 (2016) - 2015
- [j39]Costanza Conti
Convergence of univariate non-stationary subdivision schemes via asymptotic similarity. Comput. Aided Geom. Des. 37: 1-8 (2015) - [j38]Nira Dyn, Allison Heard, Kai Hormann
Univariate subdivision schemes for noisy data with geometric applications. Comput. Aided Geom. Des. 37: 85-104 (2015) - [j37]Nira Dyn, Pavel Kozlov:
Adaptive thinning of centers for approximation of a large data set by radial functions. J. Approx. Theory 200: 153-169 (2015) - 2014
- [b1]Nira Dyn, Elza M. Farkhi, Alona Mokhov:
Approximation of Set-Valued Functions - Adaptation of Classical Approximation Operator. Imperial College Press 2014, ISBN 978-1-78326-302-8, pp. 1-153 - [j36]Nira Dyn, Michael S. Floater:
Multivariate polynomial interpolation on lower sets. J. Approx. Theory 177: 34-42 (2014) - 2013
- [j35]Nira Dyn, Maria Skopina
Decompositions of trigonometric polynomials with applications to multivariate subdivision schemes. Adv. Comput. Math. 38(2): 321-349 (2013) - [j34]Shay Kels, Nira Dyn:
Subdivision Schemes of Sets and the Approximation of Set-Valued Functions in the Symmetric Difference Metric. Found. Comput. Math. 13(5): 835-865 (2013) - 2012
- [j33]Nira Dyn, Kai Hormann
Geometric conditions for tangent continuity of interpolatory planar subdivision curves. Comput. Aided Geom. Des. 29(6): 332-347 (2012) - [j32]Costanza Conti
Interpolatory blending net subdivision schemes of Dubuc-Deslauriers type. Comput. Aided Geom. Des. 29(9): 722-735 (2012) - [j31]Nir Sharon
Bivariate interpolation based on univariate subdivision schemes. J. Approx. Theory 164(5): 709-730 (2012) - [j30]Albert Cohen, Nira Dyn, Frédéric Hecht, Jean-Marie Mirebeau:
Adaptive multiresolution analysis based on anisotropic triangulations. Math. Comput. 81(278): 789-810 (2012) - 2011
- [j29]Shay Kels, Nira Dyn:
Reconstruction of 3D objects from 2D cross-sections with the 4-point subdivision scheme adapted to sets. Comput. Graph. 35(3): 741-746 (2011) - [j28]Nira Dyn, Ron Goldman:
Convergence and Smoothness of Nonlinear Lane-Riesenfeld Algorithms in the Functional Setting. Found. Comput. Math. 11(1): 79-94 (2011) - [j27]Costanza Conti
Analysis of subdivision schemes for nets of functions by proximity and controllability. J. Comput. Appl. Math. 236(4): 461-475 (2011) - [j26]Mira Bozzini, Nira Dyn, Milvia Rossini:
Construction of generators of quasi-interpolation operators of high approximation orders in spaces of polyharmonic splines. J. Comput. Appl. Math. 236(4): 557-564 (2011) - 2010
- [j25]Shay Kels, Nira Dyn, Evgeny Lipovetsky:
Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries. Algorithms 3(3): 265-275 (2010) - [j24]Costanza Conti
Blending based corner cutting subdivision scheme for nets of curves. Comput. Aided Geom. Des. 27(4): 340-358 (2010) - [j23]Nira Dyn, Philipp Grohs, Johannes Wallner:
Approximation order of interpolatory nonlinear subdivision schemes. J. Comput. Appl. Math. 233(7): 1697-1703 (2010)
2000 – 2009
- 2009
- [j22]Nira Dyn, Michael S. Floater, Kai Hormann
Four-point curve subdivision based on iterated chordal and centripetal parameterizations. Comput. Aided Geom. Des. 26(3): 279-286 (2009) - [j21]Nira Dyn, Elza M. Farkhi
Multi-segmental representations and approximation of set-valued functions with 1D images. J. Approx. Theory 159(1): 39-60 (2009) - [j20]Ziv Ayalon, Nira Dyn, David Levin:
Piecewise L-splines of order 4: Interpolation and L2 error bounds for splines in tension. J. Approx. Theory 161(2): 421-431 (2009) - [j19]Tamir Tassa, Nira Dyn:
Multipartite Secret Sharing by Bivariate Interpolation. J. Cryptol. 22(2): 227-258 (2009) - 2008
- [j18]Nira Dyn, Armin Iske, Holger Wendland
Meshfree Thinning of 3D Point Clouds. Found. Comput. Math. 8(4): 409-425 (2008) - [j17]Nira Dyn, Kai Hormann
Polynomial reproduction by symmetric subdivision schemes. J. Approx. Theory 155(1): 28-42 (2008) - 2007
- [j16]Evgeny Lipovetsky, Nira Dyn:
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing. Adv. Comput. Math. 26(1-3): 269-282 (2007) - [j15]Carsten Moenning, Facundo Mémoli, Guillermo Sapiro, Nira Dyn, Neil A. Dodgson
Meshless geometric subdivision. Graph. Model. 69(3-4): 160-179 (2007) - [j14]Nira Dyn, David Levin, Jungho Yoon:
Analysis of Univariate Nonstationary Subdivision Schemes with Application to Gaussian-Based Interpolatory Schemes. SIAM J. Math. Anal. 39(2): 470-488 (2007) - [j13]Roman Kazinnik, Shai Dekel, Nira Dyn:
Low Bit-Rate Image Coding Using Adaptive Geometric Piecewise Polynomial Approximation. IEEE Trans. Image Process. 16(9): 2225-2233 (2007) - 2006
- [j12]Laurent Demaret, Nira Dyn, Armin Iske:
Image compression by linear splines over adaptive triangulations. Signal Process. 86(7): 1604-1616 (2006) - [c2]Tamir Tassa, Nira Dyn:
Multipartite Secret Sharing by Bivariate Interpolation. ICALP (2) 2006: 288-299 - 2005
- [j11]Johannes Wallner, Nira Dyn:
Convergence and C1 analysis of subdivision schemes on manifolds by proximity. Comput. Aided Geom. Des. 22(7): 593-622 (2005) - [j10]Francesc Aràndiga
Interpolation and Approximation of Piecewise Smooth Functions. SIAM J. Numer. Anal. 43(1): 41-57 (2005) - [p8]Nurit Alkalai, Nira Dyn:
Optimising 3D Triangulations: Improving the Initial Triangulation for the Butterfly Subdivision Scheme. Advances in Multiresolution for Geometric Modelling 2005: 231-244 - [p7]Martin Marinov, Nira Dyn, David Levin:
Geometrically Controlled 4-Point Interpolatory Schemes. Advances in Multiresolution for Geometric Modelling 2005: 301-315 - [p6]Laurent Demaret, Nira Dyn, Michael S. Floater, Armin Iske:
Adaptive Thinning for Terrain Modelling and Image Compression. Advances in Multiresolution for Geometric Modelling 2005: 319-338 - 2004
- [j9]Alla Sheffer, Craig Gotsman
Robust Spherical Parameterization of Triangular Meshes. Computing 72(1-2): 185-193 (2004) - 2003
- [j8]Nira Dyn, David Levin, Ariel Luzzatto:
Exponentials Reproducing Subdivision Schemes. Found. Comput. Math. 3(2): 187-206 (2003) - 2002
- [p5]Nira Dyn:
Interpolatory Subdivision Schemes. Tutorials on Multiresolution in Geometric Modelling 2002: 25-50 - [p4]Nira Dyn:
Analysis of Convergence and Smoothness by the Formalism of Laurent Polynomials. Tutorials on Multiresolution in Geometric Modelling 2002: 51-68
1990 – 1999
- 1999
- [j7]Nira Dyn, Frans Kuijt, David Levin, Ruud van Damme:
Convexity preservation of the four-point interpolatory subdivision scheme. Comput. Aided Geom. Des. 16(8): 789-792 (1999) - 1994
- [j6]Nur Arad, Nira Dyn, Daniel Reisfeld, Yehezkel Yeshurun:
Image Warping by Radial Basis Functions: Application to Facial Expressions. CVGIP Graph. Model. Image Process. 56(2): 161-172 (1994) - [c1]Nira Dyn:
The Work of John Gregory, Rational Spline Interpolation, Subdivision Algorithms and C Polygonal Patches. IMA Conference on the Mathematics of Surfaces 1994: 21-41 - 1993
- [j5]Nira Dyn, Ifat Goren, Shmuel Rippa:
Transforming triangulations in polygonal domains. Comput. Aided Geom. Des. 10(6): 531-536 (1993) - 1992
- [j4]Nira Dyn, David Levin, Dingyuan Liu:
Interpolatory convexity-preserving subdivision schemes for curves and surfaces. Comput. Aided Des. 24(4): 211-216 (1992) - 1991
- [p3]Martin D. Buhmann, Nira Dyn:
Error Estimates for Multiquadric Interpolation. Curves and Surfaces 1991: 51-58 - [p2]Nira Dyn, David Levin, I. Yad-Shalom:
Regularity Conditions for a Class of Geometrically Continuous Curves and Surfaces. Curves and Surfaces 1991: 169-176 - 1990
- [j3]Nira Dyn, David Levin, Charles A. Micchelli:
Using parameters to increase smoothness of curves and surfaces generated by subdivision. Comput. Aided Geom. Des. 7(1-4): 129-140 (1990) - [j2]Nira Dyn, David Levine, John A. Gregory:
A butterfly subdivision scheme for surface interpolation with tension control. ACM Trans. Graph. 9(2): 160-169 (1990)
1980 – 1989
- 1987
- [j1]Nira Dyn, David Levin, John A. Gregory:
A 4-point interpolatory subdivision scheme for curve design. Comput. Aided Geom. Des. 4(4): 257-268 (1987) - [p1]Nira Dyn:
Interpolation of scattered Data by radial Functions. Topics in Multivariate Approximation 1987: 47-61
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-07-20 20:35 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: