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.

Leon A. Shirman

dblp:80/6137 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 1993
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 7 · 6 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
2 papers
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › curve fitting
spline interpolation
0.021992
Procedural interpolation with curvature-continuous cubic splines · Comput. Aided Des. 1992
Procedural interpolation with geometrically continuous cubic splines · Comput. Aided Des. 1992
YearPublicationVenuePosition
1993 The Cone of Normals Technique for Fast Processing of Curved Patches
abstract
Abstract The cone of normals technique for curved surface patches allows to perform various quick tests at the patch level such as front‐ or backfacing test, light influence test, and existence of silhouette edges test. For a given patch, a truncated cone of normals is constructed at creation time, which contains all points and all normal directions of the patch. At traversal time, a simple scalar product test determines whether the whole patch is backfacing or frontfacing, so that the costly step of tessellating the patch is avoided in case of patch level face culling. In addition, the technique quickly determines which light sources have no influence on a patch, and which patches have no silhouette edges. The technique can also be used for other surface primitives, such as triangular strips and quadrilateral meshes,
Leon A. Shirman, Salim S. Abi-Ezzi
Comput. Graph. Forum1
1992 Procedural interpolation with geometrically continuous cubic splines
Leon A. Shirman, Carlo H. Séquin
Comput. Aided Des.1
1992 Procedural interpolation with curvature-continuous cubic splines
Leon A. Shirman, Carlo H. Séquin
Comput. Aided Des.1
1991 Tessellation of Curved Surfaces under Highly Varying Transformations
abstract
We pursue the problem of step size determination for tessellating arbitrary degree polynomial and rational Bezier patches, under highly varying modeling and viewing transformations, to within post-viewing size and/or deviation thresholds specified in display coordinates. The technique involves the computation of derivative bounds of surfaces in modeling coordinates, and the mapping of these bounds into world coordinates (or lighting coordinates), where tessellation takes place by using norms of modeling transformations. A key result of this work is a closed form expression for the maximum scale a perspective transformation is capable of at an arbitrary point in space. This result allows the mapping of thresholds from DC into WC (LC). In practice, while the step size determination needs to take place during every traversal, the costly operations of finding derivative bounds, computing norms of modeling transformations, and factoring viewing transformations take place at creation time.
Salim S. Abi-Ezzi, Leon A. Shirman
Eurographics2
1991 Local surface interpolation with Bézier patches: errata and improvements
Leon A. Shirman, Carlo H. Séquin
Comput. Aided Geom. Des.1
1990 Local surface interpolation with shape parameters between adjoining Gregory patches
Leon A. Shirman, Carlo H. Séquin
Comput. Aided Geom. Des.1
1987 Local surface interpolation with Bézier patches
Leon A. Shirman, Carlo H. Séquin
Comput. Aided Geom. Des.1