Demo Data from EDBT 2026 / reviewers in the wild / expert
Shelley Skinner
dblp:21/2982
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, 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 · 100% |
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 › surface reconstruction
curve-based reconstruction |
0.0 | 1 | 1992 | Surfaces from Contours · ACM Trans. Graph. 1992 |
Geometric modeling and processing
surface reconstruction |
0.0 | 1 | 1992 | Surfaces from Contours · ACM Trans. Graph. 1992 |
Methods — techniques the papers use, named apart from their topics
parametric surface fitting · 0.0minimum spanning tree · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Surfaces from ContoursabstractThis paper is concerned with the problem of reconstructing the surfaces of three-dimensional objects, given a collection of planar contours representing cross-sections through the objects. This problem has important aplications in biomedical research and instruction, solid modeling, and industrial inspection. The method we describe produces a triangulated mesh from the data points of the contours which is then used in conjunction with a piecewise parametric surface-fitting algorithm to produce a reconstructed surface. The problem can be broken into four subproblems: the correspondence problem (which contours should be connected by the surface?), the tiling problem (how should the contours be connected?), the branching problem (what do we do when there are branches in the surface?), and the surface-fitting problem (what is the precise geometry of the reconstructed surface?) We describe our system for surface reconstruction from sets of contours with respect to each of these subproblems. Special attention is given to the correspondence and branching problems. We present a method that can handle sets of contours in which adjacent contours share a very contorted boundary, and we describe a new approach to solving the correspondence problem using a Minimum Spanning Tree generated from the contours. David Meyers, Shelley Skinner, Kenneth R. Sloan |
ACM Trans. Graph. | 2 |