Helmut Ratschek

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

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:42/3910 · DBLP profile ↗

← Back

9ranked-venue papers

7as first author

0since 2021 · last 2001

—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-authorTheory of computation · 4 · 2 first-authorDatabases, data management, data science and information retrieval · 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

3 papers

Computational geometry · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Computational geometry geometric intersection	0.0	3	2000	How trivial are reliable box-plane intersections? · Comput. Aided Des. 2000 Box-sphere intersection tests · Comput. Aided Des. 1994 Test for intersection between plane and box · Comput. Aided Des. 1993

Year	Publication	Venue	Position
2001	Robustness in GIS algorithm implementation with application to line simplification abstract The sensitivity of computed results to implementations of algorithms in GIS is considered in this paper on the example of a precisely defined recursive variant of the Ramer-Douglas-Peucker line simplification algorithm (called the R-D-P algorithm). We establish a robust version of the R-D-P algorithm where the determination of the simplification is rounding error free if the data are already machine numbers. Under these assumptions, the results are reproducible which is not the case with other versions of the algorithm. Helmut Ratschek, Jon G. Rokne, M. Leriger	Int. J. Geogr. Inf. Sci.	1
2000	How trivial are reliable box-plane intersections? Helmut Ratschek, Jon G. Rokne	Comput. Aided Des.	1
1999	Global Interval Methods for Local Nonsmooth Optimization Christiane Görges, Helmut Ratschek	J. Glob. Optim.	2
1996	The relationship between a rectangle and a triangle Helmut Ratschek, Jon G. Rokne	Vis. Comput.	1
1994	Box-sphere intersection tests Helmut Ratschek, Jon G. Rokne	Comput. Aided Des.	1
1993	Test for intersection between plane and box Helmut Ratschek, Jon G. Rokne	Comput. Aided Des.	1
1993	Experiments using interval analysis for solving a circuit design problem Helmut Ratschek, Jon G. Rokne	J. Glob. Optim.	1
1991	What can interval analysis do for global optimization? Helmut Ratschek, Rudolf L. Voller	J. Glob. Optim.	1
1974	Eigenschaften der von linearen Automaten erkennbaren Worte Klaus H. Ecker, Helmut Ratschek	Acta Informatica	2