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

Damian J. Sheehy

dblp:15/6419 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape representation › medial representation
medial surface
0.011996
Shape Description By Medial Surface Construction · IEEE Trans. Vis. Comput. Graph. 1996
Geometric modeling and processing
shape representation
0.011996
Shape Description By Medial Surface Construction · IEEE Trans. Vis. Comput. Graph. 1996
Computational geometry › triangulation
delaunay triangulation
0.011996
Shape Description By Medial Surface Construction · IEEE Trans. Vis. Comput. Graph. 1996

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

boundary point refinement · 0.0b-rep solid modeling · 0.0
YearPublicationVenuePosition
1996 Shape Description By Medial Surface Construction
abstract
The medial surface is a skeletal abstraction of a solid that provides useful shape information, which compliments existing model representation schemes. The medial surface and its associated topological entities are defined, and an algorithm for computing the medial surface of a large class of B-rep solids is then presented. The algorithm is based on the domain Delaunay triangulation of a relatively sparse distribution of points, which are generated on the boundary of the object. This strategy is adaptive in that the boundary point set is refined to guarantee a correct topological representation of the medial surface.
Damian J. Sheehy, Cecil G. Armstrong, Desmond J. Robinson
IEEE Trans. Vis. Comput. Graph.1