A rational rotation method for robust geometric algorithms

Algorithms in computational geometry often use the real-RAM model of computation. In particular, this model assumes that exact real numbers can be stored in and retrieved from memory in constant $O$ (1) time, and that field operations (+, -, *, /) and certain other operations (like square root, sine and cosine) are also ``exact,'''' and can be applied in constant time.

[1]  Bruce Randall Donald,et al.  Error Detection and Recovery in Robotics , 1989, Lecture Notes in Computer Science.

[2]  John E. Hopcroft,et al.  Towards implementing robust geometric computations , 1988, SCG '88.

[3]  Boris Aronov,et al.  The furthest-site geodesic voronoi diagram , 1993, SCG '88.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[6]  Randy C. Brost,et al.  Graphical analysis of planar rigid-body dynamics with multiple frictional contacts , 1991 .

[7]  Zhenyu Li,et al.  Constructing strongly convex hulls using exact or rounded arithmetic , 1990, SCG '90.

[8]  Hans Rademacher,et al.  Lectures on Elementary Number Theory , 1977 .

[9]  Michael A. Erdmann,et al.  Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[10]  Victor J. Milenkovic,et al.  Finding compact coordinate representations for polygons and polyhedra , 1990, SCG '90.

[11]  Kokichi Sugihara,et al.  A solid modelling system free from topological inconsistency , 1990 .

[12]  Bruce Randall Donald,et al.  On the motion of compliantly-connected rigid bodies in contact. II. A system for analyzing designs for assembly , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[13]  John F. Canny,et al.  On computability of fine motion plans , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[14]  Amy J. Briggs.  An efficient algorithm for one-step planar complaint motion planning with uncertainty , 1989, SCG '89.

[15]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .