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.

Osman Berat Okutan

dblp:256/9952 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-0149-8624ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

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 · 70% Algorithmic game theory and mechanism design · 30%

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

TopicWeightPapersLastEvidence papers
Computational geometry › topological data analysis
reeb space
0.812024
Stability and Approximations for Decorated Reeb Spaces · SoCG 2024
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
stability
0.812024
Stability and Approximations for Decorated Reeb Spaces · SoCG 2024
Computational geometry
topological data analysis
0.812024
Stability and Approximations for Decorated Reeb Spaces · SoCG 2024
Computational geometry › geometric modeling and processing
point cloud analysis
0.212024
Stability and Approximations for Decorated Reeb Spaces · SoCG 2024

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

persistence diagrams · 0.8
YearPublicationVenuePosition
2024 Stability and Approximations for Decorated Reeb Spaces
abstract
Given a map $f:X \to M$ from a topological space $X$ to a metric space $M$, a decorated Reeb space consists of the Reeb space, together with an attribution function whose values recover geometric information lost during the construction of the Reeb space. For example, when $M=\mathbb{R}$ is the real line, the Reeb space is the well-known Reeb graph, and the attributions may consist of persistence diagrams summarizing the level set topology of $f$. In this paper, we introduce decorated Reeb spaces in various flavors and prove that our constructions are Gromov-Hausdorff stable. We also provide results on approximating decorated Reeb spaces from finite samples and leverage these to develop a computational framework for applying these constructions to point cloud data.
Justin Curry, Washington Mio, Tom Needham, Osman Berat Okutan, Florian Russold
SoCG4
2021 Quantitative Simplification of Filtered Simplicial Complexes
Facundo Mémoli, Osman Berat Okutan
Discret. Comput. Geom.2