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

Alan P. Mangan

dblp:64/2583 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1999
—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 · 44% Image and video processing · 44% Visualization and visual analytics · 13%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh segmentation
0.011999
Partitioning 3D Surface Meshes Using Watershed Segmentation · IEEE Trans. Vis. Comput. Graph. 1999
Image and video processing › image segmentation › region-based segmentation
watershed segmentation
0.011999
Partitioning 3D Surface Meshes Using Watershed Segmentation · IEEE Trans. Vis. Comput. Graph. 1999
Visualization and visual analytics › scientific visualization › geometric visualization
surface visualization
0.011999
Partitioning 3D Surface Meshes Using Watershed Segmentation · IEEE Trans. Vis. Comput. Graph. 1999

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

morphological watershed · 0.0
YearPublicationVenuePosition
1999 Partitioning 3D Surface Meshes Using Watershed Segmentation
abstract
This paper describes a method for partitioning 3D surface meshes into useful segments. The proposed method generalizes morphological watersheds, an image segmentation technique, to 3D surfaces. This surface segmentation uses the total curvature of the surface as an indication of region boundaries. The surface is segmented into patches, where each patch has a relatively consistent curvature throughout, and is bounded by areas of higher, or drastically different, curvature. This algorithm has applications for a variety of important problems in visualization and geometrical modeling including 3D feature extraction, mesh reduction, texture mapping 3D surfaces, and computer aided design.
Alan P. Mangan, Ross T. Whitaker
IEEE Trans. Vis. Comput. Graph.1