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

Matthias John 0003

dblp:j/MatthiasJohn3 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4Theory of computation · 3Human-computer interaction and ubiquitous computing · 1

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 · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Computational geometry
geometric modeling and processing
0.012003
Alpha-shapes and flow shapes are homotopy equivalent · STOC 2003
Computational geometry › geometric modeling and processing › point cloud analysis › geometric reconstruction
surface reconstruction
0.012003
Alpha-shapes and flow shapes are homotopy equivalent · STOC 2003
Computational geometry › computational topology
alpha shapes
0.012003
Alpha-shapes and flow shapes are homotopy equivalent · STOC 2003

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

topological analysis · 0.0homotopy equivalence · 0.0
YearPublicationVenuePosition
2008 Recursive geometry of the flow complex and topology of the flow complex filtration
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthias John 0003
Comput. Geom.4
2008 The flow complex: A data structure for geometric modeling
Joachim Giesen, Matthias John 0003
Comput. Geom.2
2003 The flow complex: a data structure for geometric modeling
Joachim Giesen, Matthias John 0003
SODA2
2003 Alpha-shapes and flow shapes are homotopy equivalent
abstract
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that transform finite point sets into continuous shapes. Due to their immense practical importance in geometric modeling various shape constructors have been proposed recently. Understanding the relations among them often leads to new insights that are potentially helpful in applications. Here we discover a topological equivalence among two such geometric structures, namely α shapes and flow shapes. Both shapes found applications in surface reconstruction and molecular modelin.
Tamal K. Dey, Joachim Giesen, Matthias John 0003
STOC3
2002 A New Diagram from Disks in the Plane
Joachim Giesen, Matthias John 0003
STACS2
2002 Surface reconstruction based on a dynamical system
abstract
We present an efficient algorithm that computes a manifold triangular mesh from a set of unorganized sample points in . The algorithm builds on the observation made by several researchers that the Gabriel graph of the sample points provides a good surface description. However, this surface description is only one-dimensional. We associate the edges of the Gabriel graph with index 1 critical points of a dynamical system induced by the sample points. Exploiting also the information contained in the critical points of index 2 provides a two-dimensional surface description which can be easily turned into a manifold.
Joachim Giesen, Matthias John 0003
Comput. Graph. Forum2
2002 Surface reconstruction using umbrella filters
Udo Adamy, Joachim Giesen, Matthias John 0003
Comput. Geom.3
2000 New techniques for topologically correct surface reconstruction
abstract
We present a novel approach to surface reconstruction based on the Delaunay complex. First we give a simple and fast algorithm that picks locally a surface at each vertex. For that, we introduce the concept of /spl lambda/-intervals. It turns out that for smooth regions of the surface this method works very well and at difficult parts of the surface yields an output well-suited for postprocessing. As a postprocessing step we propose a topological clean up and a new technique based on linear programming in order to establish a topologically correct surface. These techniques should be useful also for many other reconstruction schemes.
Udo Adamy, Joachim Giesen, Matthias John 0003
IEEE Visualization3