Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eric de Sturler

dblp:58/2546 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2002
0000-0002-9412-9360ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 67% Rendering · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › surface parameterization
distortion minimization
0.012002
Smoothing an overlay grid to minimize linear distortion in texture mapping · ACM Trans. Graph. 2002
Geometric modeling and processing
surface parameterization
0.012002
Smoothing an overlay grid to minimize linear distortion in texture mapping · ACM Trans. Graph. 2002
Rendering
texture mapping
0.012002
Smoothing an overlay grid to minimize linear distortion in texture mapping · ACM Trans. Graph. 2002

Methods — techniques the papers use, named apart from their topics

laplacian smoothing · 0.0inverse mapping · 0.0
YearPublicationVenuePosition
2002 Smoothing an overlay grid to minimize linear distortion in texture mapping
abstract
Texture is an essential component of computer generated models. For a texture mapping procedure to be effective it has to generate continuous textures and cause only small mapping distortion. The Angle Based Flattening (ABF) parameterization method is guaranteed to provide a continuous (no foldovers) mapping. It also minimizes the angular distortion of the parameterization, including locating the optimal planar domain boundary. However, since it concentrates on minimizing the angular distortion of the mapping, it can introduce relatively large linear distortion.In this paper we introduce a new procedure for reducing length distortion of an existing parameterization and apply it to ABF results. The linear distortion reduction is added as a second step in a texture mapping computation. The new method is based on computing a mapping from the plane to itself which has length distortion very similar to that of the ABF parameterization. By applying the inverse mapping to the result of the initial parameterization, we obtain a new parameterization with low length distortion. We notice that the procedure for computing the inverse mapping can be applied to any other (convenient) mapping from the three-dimensional surface to the plane in order to improve it.The mapping in the plane is computed by applying weighted Laplacian smoothing to a Cartesian grid covering the planar domain of the initial mapping. Both the mapping and its inverse are provably continuous. Since angle preserving (conformal) mappings, such as ABF, locally preserve distances as well, the planar mapping has small local deformation. As a result, the inverse mapping does not significantly increase the angular distortion.The combined texture mapping procedure provides a mapping with low distance and angular distortion, which is guaranteed to be continuous.
Alla Sheffer, Eric de Sturler
ACM Trans. Graph.2
1998 Parallel iterative solvers for irregular sparse matrices in High Performance Fortran
Eric de Sturler, Damian Loher
Future Gener. Comput. Syst.1
1996 A Performance Model for Krylov Subspace Methods on Mesh-Based Parallel Computers
Eric de Sturler
Parallel Comput.1