Searching for authors named "Adi Levin" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Filling an N-sided hole using combined subdivision schemes
- … is used as a com- adilev@(email omitted);, http://www.math.tau.ac.il/~adilev Adi Levin Tel Aviv university…
- Cited by 3 (0 self) – Add To MetaCart
-
Boundary algorithms for subdivision surfaces
- … Boundary Algorithms for Subdivision Surfaces Adi Levin1 Tel Aviv University . 1 Abstract…
- Cited by 1 (1 self) – Add To MetaCart
-
Combined Subdivision Schemes for the design of surfaces satisfying boundary conditions
- …Combined Subdivision Schemes for the design of surfaces satisfying boundary conditions Adi Levin…
- Cited by 20 (4 self) – Add To MetaCart
-
Modified subdivision surfaces with continuous curvature
- …Modified subdivision surfaces with continuous curvature Adi Levin ∗ Cadent Ltd. (a) (b) (c) (d) (e…
- Cited by 9 (0 self) – Add To MetaCart
-
Fitting Subdivision Surfaces
- … approximations on the same surface. Adi Levin Tel Aviv University Peter Schröder Caltech Figure 1: Fitting…
- Cited by 34 (1 self) – Add To MetaCart
-
Piecewise Smooth Subdivision Surfaces with Normal Control
- …@(email omitted); Adi Levin † Tel Aviv University Denis Zorin ‡ New York University Often, only an approximate…
- Cited by 63 (8 self) – Add To MetaCart
-
Trimming for Subdivision Surfaces
- …Abstract Trimming for Subdivision Surfaces Nathan Litke a,1 Adi Levin b,2 Peter Schröder a,3 a…
- Cited by 21 (2 self) – Add To MetaCart
-
you give me energy for the
- … Advisory Board: Al Barr, Tom Duchamp, Igor Guskov, Anil Hirani, Andrei Khodakovsky, Adi Levin, Jerry…
- Add To MetaCart
-
Piecewise Smooth Subdivision Surfaces with Normal Control
- … Adi Levin + Tel Aviv University Denis Zorin # New York University Abstract In this paper we…
- Add To MetaCart
-
www.elsevier.com/locate/acha Analysis of quasi-uniform subdivision
- …-uniform subdivision Adi Levin a and David Levin b,∗ a Cadent Ltd., 17 HaTa’assiya st., Or Yehuda 60408, Israel b…
- Add To MetaCart
Showing 1 through 10.
