Остановите войну!
for scientists:
default search action
Thomas Roos
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Ícaro A. F. Oliveira, Thomas Roos, Serge O. Dumoulin, Jeroen C. W. Siero, Wietske van der Zwaag:
Can 7T MPRAGE match MP2RAGE for gray-white matter contrast? NeuroImage 240: 118384 (2021)
1990 – 1999
- 1998
- [j6]Gerhard Albers, Leonidas J. Guibas, Joseph S. B. Mitchell, Thomas Roos:
Voronoi Diagrams of Moving Points. Int. J. Comput. Geom. Appl. 8(3): 365-380 (1998) - 1997
- [j5]Thomas Roos:
New Upper Bounds on Voronoi Diagrams of Moving Points. Nord. J. Comput. 4(2): 167-171 (1997) - [j4]Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer:
Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181(1): 3-15 (1997) - [e2]Marc J. van Kreveld, Jürg Nievergelt, Thomas Roos, Peter Widmayer:
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, Udine, Italy, September 16-20, 1996. Lecture Notes in Computer Science 1340, Springer 1997, ISBN 3-540-63818-0 [contents] - 1996
- [c15]Mark de Berg, Prosenjit Bose, Katrin Dobrindt, Marc J. van Kreveld, Mark H. Overmars, Marko de Groot, Thomas Roos, Jack Snoeyink, Sidi Yu:
The Complexity of Rivers in Triangulated Terrains. CCCG 1996: 325-330 - [p1]Edouard Bugnion, Thomas Roos, Roger Wattenhofer, Peter Widmayer:
Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996: 199-211 - 1995
- [j3]Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer:
On Optimal Cuts of Hyperrectangles. Computing 55(3): 191-206 (1995) - [c14]Tetsuo Asano, Naoki Katoh, Elena Lodi, Thomas Roos:
Optimal approximation of monotone curves on a grid. CCCG 1995: 37-42 - [c13]Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer:
Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995: 36-48 - 1994
- [j2]Thomas Roos, Peter Widmayer:
k-Violation Linear Programming. Inf. Process. Lett. 52(2): 109-114 (1994) - [c12]Thomas Roos, Fei Shi, Peter Widmayer:
A Data Structure for Approximate String Searching. HICSS (5) 1994: 45-46 - [c11]Thomas Roos:
Maintaining Voronoi Diagrams in Parallel. HICSS (2) 1994: 179-186 - [c10]Christopher M. Gold, Thomas Roos:
Surface Modelling with Guaranteed Consistency - An Object-Based Approach. IGIS 1994: 70-87 - [e1]Jürg Nievergelt, Thomas Roos, Hans-Jörg Schek, Peter Widmayer:
IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings. Lecture Notes in Computer Science 884, Springer 1994, ISBN 3-540-58795-0 [contents] - 1993
- [j1]Thomas Roos:
Voronoi Diagrams over Dynamic Scenes. Discret. Appl. Math. 43(3): 243-259 (1993) - [c9]Viet Hai Nguyen, Thomas Roos, Peter Widmayer:
Balanced Cuts of a Set of Hyperrectangles. CCCG 1993: 121-126 - [c8]Thomas Roos:
Tighter Bounds on Voronoi Diagrams of Moving Points. CCCG 1993: 358-363 - [c7]Fabrizio d'Amore, Thomas Roos, Peter Widmayer:
An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993: 215-224 - [c6]Thomas Roos, Peter Widmayer:
k-violation linear programming. System Modelling and Optimization 1993: 855-862 - 1992
- [c5]Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach:
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. GI Jahrestagung 1992: 319-325 - [c4]Thomas Roos, Gerhard Albers:
Maintaining Proximity in Higher Dimensional Spaces. MFCS 1992: 483-493 - [c3]Gerhard Albers, Thomas Roos:
Voronoi Diagrams of Moving Points in Higher Dimensional Spaces. SWAT 1992: 399-409 - 1991
- [b1]Thomas Roos:
Dynamic Voronoi diagrams. Julius Maximilians University Würzburg, Germany, 1991, pp. 1-213 - [c2]Thomas Roos, Hartmut Noltemeier:
Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry 1991: 227-236
1980 – 1989
- 1989
- [c1]Thomas Roos:
k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points. WG 1989: 330-340
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint