Demo Data from EDBT 2026 / reviewers in the wild / expert
Amira Solomovici
dblp:58/1547
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 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 · 77% Computer animation and physical simulation · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › shape deformation
shape evolution |
0.0 | 1 | 1998 | Three-Dimensional Distance Field Metamorphosis · ACM Trans. Graph. 1998 |
Computer animation and physical simulation
keyframe animation |
0.0 | 1 | 1998 | Three-Dimensional Distance Field Metamorphosis · ACM Trans. Graph. 1998 |
Methods — techniques the papers use, named apart from their topics
warp functions · 0.0distance field interpolation · 0.0anchor points · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Three-Dimensional Distance Field MetamorphosisabstractGiven two or more objects of general topology, intermediate objects are constructed by a distance field metamorphosis. In the presented method the interpolation of the distance field is guided by a warp function controlled by a set of corresponding anchor points. Some rules for defining a smooth least-distorting warp function are given. To reduce the distortion of the intermediate shapes, the warp function is decomposed into a rigid rotational part and an elastic part. The distance field interpolation method is modified so that the interpolation is done in correlation with the warp function. The method provides the animator with a technique that can be used to create a set of models forming a smooth transition between pairs of a given sequence of keyframe models. The advantage of the new approach is that it is capable of morphing between objects having a different topological genus where no correspondence between the geometric primitives of the models needs to be established. The desired correspondence is defined by an animator in terms of a relatively small number of anchor points Daniel Cohen-Or, Amira Solomovici, David Levin |
ACM Trans. Graph. | 2 |
| 1996 | Contour Blending Using Warp-Guided Distance Field InterpolationabstractGiven (n-1)-dimensional parallel cross-sections of an n-dimensional body, one would like to reconstruct the n-dimensional body. The method based on Distance Field Interpolation (DFI) gives a robust solution to this problem in its ability to deal with any topology in any dimension. Still this method may give undesired solutions to the problem if the changes from one cross-section to the next are significant relative to the size of the details in the cross-sections. We consider the problem of solid reconstruction from contours, which can also be considered as a contour blending or contour morphing problem, where the third dimension is time. The method presented is based on interpolation of the distance field, guided by a warp function which is controlled by a set of corresponding anchor points. Some rules for defining a smooth least-distorting warp function are given. To reduce the distortion of the intermediate shapes, the warp function is decomposed into a rigid rotational part and an elastic part. The distance field interpolation method is modified so that the interpolation is guided by the warp function. The advantage of the new approach is that it is capable of blending between contours having different topological genus, and no correspondence between the geometric primitives should be established. The desired general correspondence is defined by the user in terms of a relatively small number of anchor points. Daniel Cohen-Or, David Levin, Amira Solomovici |
IEEE Visualization | 3 |