Dan Halperin

Proceedings of the Algorithms, 2004

Engineering Geometric Algorithms: Persistent Problems and Some Solutions (Abstract of invited talk).

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2003

2002

The 2-Center Problem with Obstacles.

[BibT_eX]

[DOI]

Kenneth Y. Goldberg

J. Algorithms, 2002

Robust Geometric Computing in Motion.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2002

Iterated snap rounding.

[BibT_eX]

[DOI]

Eli Packer

Comput. Geom., 2002

Polygon decomposition for efficient construction of Minkowski sums.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Eyal Flato

Comput. Geom., 2002

Separating an object from its cast.

[BibT_eX]

[DOI]

Comput. Aided Des., 2002

Hybrid Motion Planning: Coordinating Two Discs Moving among Polygonal Obstacles in the Plane.

[BibT_eX]

[DOI]

Shai Hirsch

Proceedings of the Algorithmic Foundations of Robotics V, 2002

Improved construction of vertical decompositions of three-dimensional arrangements.

[BibT_eX]

[DOI]

Hayim Shaul

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Efficient maintenance and self-collision testing for Kinematic Chains.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

Exact minkowski sums and applications.

[BibT_eX]

[DOI]

Proceedings of the 18th Annual Symposium on Computational Geometry, 2002

2001

On the Number of Regular Vertices of the Union of Jordan Regions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Richard Pollack

Discret. Comput. Geom., 2001

2000

The Design and Implementation of Planar Maps in CGAL.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2000

A General Framework for Assembly Planning: The Motion Space Approach.

[BibT_eX]

[DOI]

Jean-Claude Latombe

Randall H. Wilson

Algorithmica, 2000

Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.

[BibT_eX]

[DOI]

Iddo Hanniel

Proceedings of the Algorithm Engineering, 2000

On the Number of Views of Polyhedral Scenes.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Robust and Efficient Construction of Planar Minkowski Sums.

[BibT_eX]

Eyal Flato

EuroCG, 2000

1999

On the Area Bisectors of a Polygon.

[BibT_eX]

[DOI]

Karl-Friedrich Böhringer

Bruce Randall Donald

Discret. Comput. Geom., 1999

The Design and Implementation of Planar Maps in CGAL.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

On-Line Zone Construction in Arrangements of Lines in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

Tutorial 9 - Visibility.

[BibT_eX]

[DOI]

Yiorgos L. Chrysanthou

Proceedings of the 20th Annual Conference of the European Association for Computer Graphics, 1999

Robot Algorithms.

[BibT_eX]

[DOI]

Lydia E. Kavraki

Jean-Claude Latombe

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1998

Combinatorial complexity of translating a box in polyhedral 3-space.

[BibT_eX]

[DOI]

Chee-Keng Yap

Comput. Geom., 1998

A perturbation scheme for spherical arrangements with application to molecular modeling.

[BibT_eX]

[DOI]

Christian R. Shelton

Comput. Geom., 1998

Spheres, molecules, and hidden surface removal.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 1998

The Dynamic Servers Problem.

[BibT_eX]

[DOI]

Moses Charikar

Rajeev Motwani

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Sparse Arrangements and the Number of Views of Polyhedral Scenes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields.

[BibT_eX]

[DOI]

Karl-Friedrich Böhringer

Bruce Randall Donald

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

Vertical Decompositions for Triangles in 3-Space.

[BibT_eX]

[DOI]

Mark de Berg

Leonidas J. Guibas

Discret. Comput. Geom., 1996

Assembly partitioning along simple paths: the case of multiple translations.

[BibT_eX]

[DOI]

Suresh Venkatasubramanian

Randall H. Wilson

Adv. Robotics, 1996

Geometric Manipulation of Flexible Ligands.

[BibT_eX]

[DOI]

Proceedings of the Applied Computational Geormetry, 1996

Efficient Generation of k-Directional Assembly Sequences.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Reaching a Goal with Directional Uncertainty.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Arrangements of Segments that Share Endpoints Single Face Results.

[BibT_eX]

[DOI]

Esther M. Arkin

Klara Kedem

Joseph S. B. Mitchell

Nir Naor

Discret. Comput. Geom., 1995

A Simple and Effeicient Procedure for Polyhedral Assembly Partitioning under Infinitesimal Motions.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Conference on Robotics and Automation, 1995

The complexity of a single face of a minkowski sum.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Robot motion planning and the single cell problem in arrangements.

[BibT_eX]

[DOI]

J. Intell. Robotic Syst., 1994

New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

Efficient Ray Shooting and Hidden Surface Removal.

[BibT_eX]

[DOI]

Algorithmica, 1994

1993

The Complexity of the Free Space for a Robot Moving Amidst Fat Obstacles.

[BibT_eX]

[DOI]

A. Frank van der Stappen

Comput. Geom., 1993

Efficient Algorithms for Exact Motion Planning Amidst Fat Obstacles.

[BibT_eX]

[DOI]

A. Frank van der Stappen

Proceedings of the 1993 IEEE International Conference on Robotics and Automation, 1993

Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992

Algorithmic motion planning via arrangements of curves and of surfaces

[BibT_eX]

[DOI]

PhD thesis, 1992

Efficient Motion Planning for an L-Shaped Object.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

1991

On Disjoint Concave Chains in Arrangements of (Pseudo) Lines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom.

[BibT_eX]

[DOI]

Comput. Geom., 1991

On the Complexity of a Single Cell in Certain Arrangements of Surfaces in 3-Space (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1989

Efficient Motion Planning for an L-Shaped Object.

[BibT_eX]

[DOI]