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

William Harvey 0001

dblp:26/8210 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—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-authorTheory of computation · 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.

Theoretical computer science
1 paper
Computational geometry · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
randomized algorithms
0.112010
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes · SCG 2010
Computational geometry › topological data analysis › reeb graph
reeb graph computation
0.112010
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes · SCG 2010
Computational geometry
topological data analysis
0.112010
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes · SCG 2010

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

randomized algorithm · 0.1
YearPublicationVenuePosition
2010 A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
abstract
Given a continuous scalar field ƒ: X → where X is a topological space, a level set of ƒ is a set {x ∈ X : ƒ (x) = α} for some value α ∈ IR. The level sets of ƒ can be subdivided into connected components. As α changes continuously, the connected components in the level sets appear, disappear, split and merge. The Reeb graph of ƒ encodes these changes in connected components of level sets. It provides a simple yet meaningful abstraction of the input domain. As such, it has been used in a range of applications in fields such as graphics and scientific visualization.
William Harvey 0001, Yusu Wang 0001, Rephael Wenger
SCG1
2010 Topological Landscape Ensembles for Visualization of Scalar-Valued Functions
abstract
Abstract Visual representation techniques enable perception and exploration of scientific data. Following the topological landscapes metaphor of Weber et al., we provide a new algorithm for visualizing scalar functions defined on simply connected domains of arbitrary dimension. For a potentially high dimensional scalar field, our algorithm produces a collection of, in some sense complete, two‐dimensional terrain models whose contour trees and corresponding topological persistences are identical to those of the input scalar field. The algorithm exactly preserves the volume of each region corresponding to an arc in the contour tree. We also introduce an efficiently computable metric on terrain models we generate. Based on this metric, we develop a tool that can help the users to explore the space of possible terrain models.
William Harvey 0001, Yusu Wang 0001
Comput. Graph. Forum1