Texture mapping using surface flattening via multidimensional scaling

IEEE Transactions on Visualization and Computer Graphics

Volumn 8, Issue 2, 2002, Pages 198-207

  Zigelman, Gil ^b   Kimmel, Ron ^c   Kiryati, Nahum ^a,d  

^a IEEE   (Israel)

^b 3DV Systems   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Euclidean distance; Fast marching method; Geodesic distance; Multidimensional scaling; Texture mapping

Indexed keywords

EUCLIDEAN DISTANCE; FAST MARCHING METHOD; GEODESIC DISTANCE; MULTIDIMENSIONAL SCALING; SURFACE FLATTENING; TEXTURE MAPPING;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; IMAGE ENHANCEMENT; IMAGE RECONSTRUCTION; INVERSE PROBLEMS; MATRIX ALGEBRA; NUMERICAL METHODS;

COMPUTER GRAPHICS;

EID: 0036529770     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.998671     Document Type: Article

References (28)

1. Isometric texture mapping for free-form surfaces
2. On using planar developments to perform texture mapping on arbitrarily curved surfaces
3. Piecewise surface flattening for non-distorted texture mapping
4. Two-part texture mapping
5. Texture and reflection in computer generated images
6. Canonical representation of 3D objects via multidimensional scaling
7. Parametrization and smooth approximation of surface triangulations
8. Parametric tilings and scattered data approximation
9. Environment mapping and other applications of world projections
10. Computing geodesics on manifolds
11. Estimating shortest paths and minimal distances on digitized three-dimensional surfaces
12. Size preserving pattern mapping
13. Non-distorted texture mapping for sheared triangulated meshes
14. A simple, fast, and effective polygon reduction algorithm
15. Pattern-based texturing revisited
16. Lapped textures
17. Texture metrics
18. A nonlinear mapping for data structure analysis
19. A numerical solution to the generalized mapmaker's problem: Flattening nonconvex polyhedral surfaces
20. A review of the theory, algorithms, and applications of level set methods for propagating interfaces
21. Efficient algorithms for globally optimal trajectories
22. Computing minimal distances on polyhedral surfaces