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.

Don Herbison-Evans

dblp:01/4796 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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 · 50% Computer animation and physical simulation · 50%

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

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation › character animation
articulated figure animation
0.011978
NUDES 2: A numeric utility displaying ellipsoid solids, version 2 · SIGGRAPH 1978
Rendering
hidden surface removal
0.011978
NUDES 2: A numeric utility displaying ellipsoid solids, version 2 · SIGGRAPH 1978

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

quartic equation solving · 0.0
YearPublicationVenuePosition
1980 How to merge hidden arcs and then not draw them
Don Herbison-Evans
Comput. Graph.1
1978 NUDES 2: A numeric utility displaying ellipsoid solids, version 2
abstract
A system is described for producing 16 mm animated films of moving humanoid figurines and other figures composed of concatenated articulated interpenetrating ellipsoids. For such figures, the hidden line algorithm used consists in solving the quartic equations which result from simultaneous pairs of ellipses viz. (a) the projection of the outline of one being drawn, and (b) that of one potentially obscuring it. This is done in terms of Cohen's parameter, resulting in an ordered list of compacted hidden arcs of each outline. The visible outlines are then generated to the required fidelity separately.Where two ellipsoids interpenetrate, the outline of each is drawn up to the points where it disappears into the other. These points can be found by the simultaneous solution of the ellipse equations of (a) the projection of the outline being drawn, and (b) the projection of the ellipse of intersection of the obscuring ellipsoid with the plane of the outline of the drawn ellipsoid.The viewing window is assumed to be an ellipse also. Parts of objects projecting outside this ellipse are not drawn.The number of quartics to be solved is reduced significantly by testing each pair of ellipsoids for non-intersection of projected outlines by comparing the projected separation of centres with the sum of their maximum semiaxis lengths, and taking advantage of the total obscuration of one ellipsoid by another when discovered.
Don Herbison-Evans
SIGGRAPH1