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

Tobias Christ

dblp:53/4270 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2012
0000-0002-5388-1986ORCID · corroborated

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

Theory of computation · 3 · 3 first-authorGraphics, 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.

Theoretical computer science
1 paper
Computational geometry · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Computational geometry
digital geometry
0.112010
Consistent digital line segments · SCG 2010
Computational geometry › digital geometry
digital line segment
0.112010
Consistent digital line segments · SCG 2010
Combinatorics and discrete mathematics
discrepancy theory
0.112010
Consistent digital line segments · SCG 2010

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

total order construction · 0.1hausdorff metric analysis · 0.1
YearPublicationVenuePosition
2012 Consistent Digital Line Segments
Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic
Discret. Comput. Geom.1
2011 Beyond Triangulation: Covering Polygons with Triangles
Tobias Christ
WADS1
2010 Consistent digital line segments
abstract
We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from any total order on the integers. As a consequence, using a well-chosen total order, we manage to define a system of digital segments such that all digital segments are, in Hausdorff metric, optimally close to their corresponding Euclidean segments, thus giving an explicit construction that resolves the main question of [1].
Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic
SCG1
2010 Improved Bounds for Wireless Localization
Tobias Christ, Michael Hoffmann 0001, Yoshio Okamoto, Takeaki Uno
Algorithmica1