Search

Your search keyword '"Rote, Günter"' showing total 11 results
Start Over Author "Rote, Günter" Topic simple polygon
11 results on '"Rote, Günter"'

2. Monotone Paths in Planar Convex Subdivisions

Author

Dumitrescu, Adrian, Rote, Günter, Tóth, Csaba D., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gudmundsson, Joachim, editor, Mestre, Julián, editor, and Viglas, Taso, editor

Published
2012
Full Text
View/download PDF

3. Triangulations with Circular Arcs

Author

Aichholzer, Oswin, Aigner, Wolfgang, Aurenhammer, Franz, Čech Dobiášová, Kateřina, Jüttler, Bert, Rote, Günter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, van Kreveld, Marc, editor, and Speckmann, Bettina, editor

Published
2012
Full Text
View/download PDF

4. Resolving Loads with Positive Interior Stresses

Author

Rote, Günter, Schulz, André, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dehne, Frank, editor, Gavrilova, Marina, editor, Sack, Jörg-Rüdiger, editor, and Tóth, Csaba D., editor

Published
2009
Full Text
View/download PDF

5. Plane Graphs with Parity Constraints

Author

Aichholzer, Oswin, Hackl, Thomas, Hoffmann, Michael, Pilz, Alexander, Rote, Günter, Speckmann, Bettina, Vogtenhuber, Birgit, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dehne, Frank, editor, Gavrilova, Marina, editor, Sack, Jörg-Rüdiger, editor, and Tóth, Csaba D., editor

Published
2009
Full Text
View/download PDF

7. The Zigzag Path of a Pseudo-Triangulation

Author

Aichholzer, Oswin, Rote, Günter, Speckmann, Bettina, Streinu, Ileana, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Dehne, Frank, editor, Sack, Jörg-Rüdiger, editor, and Smid, Michiel, editor

Published
2003
Full Text
View/download PDF

10. Reprint of: Memory-constrained algorithms for simple polygons.

Author

Asano, Tetsuo, Buchin, Kevin, Buchin, Maike, Korman, Matias, Mulzer, Wolfgang, Rote, Günter, and Schulz, André

Subjects
*COMPUTER storage devices, *COMPUTER algorithms, *POLYGONS, *GRAPH theory, *TRIANGULATION, *QUADRATIC equations
Abstract

A constant-work-space algorithm has read-only access to an input array and may use only O ( 1 ) additional words of O ( log n ) bits, where n is the input size. We show how to triangulate a plane straight-line graph with n vertices in O ( n 2 ) time and constant work-space. We also consider the problem of preprocessing a simple polygon P for shortest path queries, where P is given by the ordered sequence of its n vertices. For this, we relax the space constraint to allow s words of work-space. After quadratic preprocessing, the shortest path between any two points inside P can be found in O ( n 2 / s ) time. [ABSTRACT FROM AUTHOR]

Published
2014
Full Text
View/download PDF

11. Memory-constrained algorithms for simple polygons.

Author

Asano, Tetsuo, Buchin, Kevin, Buchin, Maike, Korman, Matias, Mulzer, Wolfgang, Rote, Günter, and Schulz, André

Subjects
*ALGORITHMS, *POLYGONS, *MATHEMATICAL constants, *READ-only memory, *GRAPH theory, *QUERY (Information retrieval system)
Abstract

Abstract: A constant-work-space algorithm has read-only access to an input array and may use only additional words of bits, where n is the input size. We show how to triangulate a plane straight-line graph with n vertices in time and constant work-space. We also consider the problem of preprocessing a simple polygon P for shortest path queries, where P is given by the ordered sequence of its n vertices. For this, we relax the space constraint to allow s words of work-space. After quadratic preprocessing, the shortest path between any two points inside P can be found in time. [Copyright &y& Elsevier]

Published
2013
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results