Sue Whitesides
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sue Whitesides has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Liotta
Department of Engineering, University of Perugia, Perugia, Italy
3 shared publications - Sylvain Lazard
Université Nancy 2, LORIA
3 shared publications - Hazel Everett
Université Nancy 2, LORIA
2 shared publications - Helmut Alt
Free University of Berlin
2 shared publications - Hervé Brönnimann
Department of Computer and Information Science, Polytechnic University, Brooklyn, NY 11201, USA
2 shared publications - Michael Godau
Free University of Berlin
2 shared publications
Latest Publications
- 1 September 2007
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 26 (9) , 917-933
Randomized Algorithms for Minimum Distance Localization
The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations. The goal, therefore, is to determine the robot's true initial location while minimizing the distance traveled by the robot. Two randomized approximation algorithms are presented that solve minimum distance localization. The performance of the proposed algorithms is evaluated empirically.
- 1 September 2007
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 26 (9) , 917-933
Randomized Algorithms for Minimum Distance Localization
The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations. The goal, therefore, is to determine the robot's true initial location while minimizing the distance traveled by the robot. Two randomized approximation algorithms are presented that solve minimum distance localization. The performance of the proposed algorithms is evaluated empirically.
- 20 March 2006
- Published by Springer Nature in Algorithmica
- Vol. 45 (2) , 159-182
A Fixed-Parameter Approach to 2-Layer Planarization
- 20 March 2006
- Published by Springer Nature in Algorithmica
- Vol. 45 (2) , 159-182
A Fixed-Parameter Approach to 2-Layer Planarization
- 2 August 2005
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 34 (3) , 381-390
Transversals to Line Segments in Three-Dimensional Space
- 2 August 2005
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 34 (3) , 381-390
Transversals to Line Segments in Three-Dimensional Space
- 16 April 2004
- Published by Springer Nature in Algorithmica
- Vol. 40 (1) , 15-31
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
- 16 April 2004
- Published by Springer Nature in Algorithmica
- Vol. 40 (1) , 15-31
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization
- Open Access
The number of transversals to line segments in R^3
We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the latter case, the transversals form up to n connected components.
Open AccessThe number of transversals to line segments in R^3
We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the latter case, the transversals form up to n connected components.
- 15 March 2002
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 117 (1) , 293-297
A note on reconfiguring tree linkages: trees can lock
- 15 March 2002
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 117 (1) , 293-297
A note on reconfiguring tree linkages: trees can lock
- 2 January 2002
- Published by Wiley in Journal of Engineering Education
- Vol. 91 (1) , 41-47
Gender and Graduate School: Engineering Students Confront Life after the B. Eng.
- 2 January 2002
- Published by Wiley in Journal of Engineering Education
- Vol. 91 (1) , 41-47
Gender and Graduate School: Engineering Students Confront Life after the B. Eng.
- 1 April 1998
- Published by Elsevier in Computational Geometry
- Vol. 10 (1) , 1-22
The rectangle of influence drawability problem
- 1 April 1998
- Published by Elsevier in Computational Geometry
- Vol. 10 (1) , 1-22
The rectangle of influence drawability problem
- 31 January 1998
- Published by Elsevier in Computational Geometry
- Vol. 9 (1-2) , 111-125
Universal 3-dimensional visibility representations for graphs
- 31 January 1998
- Published by Elsevier in Computational Geometry
- Vol. 9 (1-2) , 111-125
Universal 3-dimensional visibility representations for graphs
- 1 October 1996
- Published by Elsevier in Information Processing Letters
- Vol. 60 (2) , 97-103
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- 1 October 1996
- Published by Elsevier in Information Processing Letters
- Vol. 60 (2) , 97-103
The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings