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

Ron Pfeifle

dblp:86/776 · also Ronald Pfeifle · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Rendering › geometric rendering
curve and surface rendering
0.011995
A platform for visualizing curves and surfaces · Comput. Aided Des. 1995

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

visualization platform · 0.0
YearPublicationVenuePosition
1996 Triangular B-splines for Blending & Filling of Polygonal Holes
Ron Pfeifle, Hans-Peter Seidel
Graphics Interface1
1996 Fitting Triangular B-Splines to Functional Scattered Data
abstract
Abstract Scattered data is, by definition, irregularly spaced. Uniform surface schemes are not well adapted to the locally varying nature of such data. Conversely, Triangular B‐Spline surfaces 2 are more flexible in that they can be built over arbitrary triangulations and thus can be adapted to the scattered data. This paper discusses the use of DMS spline surfaces for approximation of scattered data. A method is provided for automatically triangulating the domain containing the points and generating basis functions over this triangulation. A surface approximating the data is then found by a combination of least squares and bending energy minimization. This combination serves both to generate a smooth surface and to accommodate for gaps in the data. Examples are presented which demonstrate the eftectiveness of the technique for mathematical, geographical and other data sets.
Ron Pfeifle, Hans-Peter Seidel
Comput. Graph. Forum1
1995 A platform for visualizing curves and surfaces
Günther Greiner, Andreas Kolb 0001, Ron Pfeifle, Hans-Peter Seidel, Philipp Slusallek, Miguel Encarnação, Reinhard Klein
Comput. Aided Des.3
1995 Spherical Triangular B-Splines with Application to Data Fitting
abstract
Abstract Triangular B‐splines surfaces are a tool for representing arbitrary piecewise polynomial surfaces over planar triangulations, while automatically maintaining continuity properties across patch boundaries. Recently, Alfeld et al. [1] introduced the concept of spherical barycentric coordinates which allowed them to formulate Bernstein‐Bézier polynomials over the sphere. In this paper we use the concept of spherical barycentric coordinates to develop a similar formulation for triangular B‐splines, which we call spherical triangular B‐splines. These splines defined over spherical triangulations share the same continuity properties and similar evaluation algorithms with their planar counterparts, but possess none of the annoying degeneracies found when trying to represent closed surfaces using planar parametric surfaces. We also present an example showing the use of these splines for approximating spherical scattered data.
Ron Pfeifle, Hans-Peter Seidel
Comput. Graph. Forum1