Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes

We describe a perturbation scheme to overcome degeneracies and precision problems for algorithms that manipulate polyhedral surfaces using floating point arithmetic. The perturbation algorithm is simple, easy to program and completely removes all degeneracies. We describe a software package that implements it, and report experimental results. The perturbation requires O(n log3 n+nDK2) expected time and O(nlog n+nK2) working storage, and has O(n) output size, where n is the total number of facets in the surfaces, K is a small constant in the input instances that we have examined, D is a constant greater than K but still small in most inputs, and both might be as large as n in ‘pathological’ inputs. A tradeoff exists between the magnitude of the perturbation and the efficiency of the computation. Our perturbation package can be used by any application that manipulates polyhedral surfaces and needs robust input, such as solid modeling, manufacturing and robotics. We describe an application for the computation of swept volumes, which uses our perturbation package and is therefore robust and does not need to handle degeneracies. Our work is based on [19] which handles the case of spheres, extending the scheme to the more difficult case of polyhedral surfaces perturbation.

[1]  Victor Y. Pan,et al.  Computing exact geometric predicates using modular arithmetic with single precision , 1997, SCG '97.

[2]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[3]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[4]  Leonidas J. Guibas,et al.  Implementing Geometric Algorithms Robustly , 1996, WACG.

[5]  Dan Halperin,et al.  A perturbation scheme for spherical arrangements with application to molecular modeling , 1997, SCG '97.

[6]  Leonidas J. Guibas,et al.  Snap rounding line segments efficiently in two and three dimensions , 1997, SCG '97.

[7]  Ming C. Leu,et al.  Geometric Representation of Swept Volumes with Application to Polyhedral Objects , 1990, Int. J. Robotics Res..

[8]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[9]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[10]  Kurt Mehlhorn,et al.  On degeneracy in geometric computations , 1994, SODA '94.

[11]  John D. Hobby,et al.  Practical segment intersection with finite precision output , 1999, Comput. Geom..

[12]  Zeng-Jia Hu,et al.  Swept volumes generated by the natural quadric surfaces , 1996, Comput. Graph..

[13]  Christopher J. Van Wyk,et al.  Static analysis yields efficient exact integer arithmetic for computational geometry , 1996, TOGS.

[14]  Lutz Kettner,et al.  Designing a data structure for polyhedral surfaces , 1998, SCG '98.

[15]  Raimund Seidel,et al.  Efficient Perturbations for Handling Geometric Degeneracies , 1997, Algorithmica.

[16]  William E. Lorensen,et al.  Implicit modeling of swept surfaces and volumes , 1994, Proceedings Visualization '94.

[17]  Franco P. Preparata.  Robustness in Geometric Algorithms , 1996, WACG.

[18]  K. Kedem,et al.  Generalized planar sweeping of polygons , 1992 .

[19]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[20]  Steven Fortune.  Vertex-Rounding a Three-Dimensional Polyhedral Subdivision , 1999, Discret. Comput. Geom..

[21]  Peter K. Allen,et al.  Swept volumes and their use in viewpoint computation in robot work-cells , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[22]  Mariette Yvinec,et al.  Evaluation of a new method to compute signs of determinants , 1995, SCG '95.

[23]  F. Frances Yao,et al.  Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  Kokichi Sugihara,et al.  On Finite-Precision Representations of Geometric Objects , 1989, J. Comput. Syst. Sci..

[25]  M. Leu,et al.  Analysis of Swept Volume via Lie Groups and Differential Equations , 1992 .

[26]  Roberto Tamassia,et al.  A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.

[27]  Victor J. Milenkovic,et al.  Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic , 1989, Artif. Intell..

[28]  Steven Fortune,et al.  Robustness Issues in Geometric Algorithms , 1996, WACG.

[29]  Dan Halperin,et al.  A perturbation scheme for spherical arrangements with application to molecular modeling , 1997, SCG '97.

[30]  Patrick G. Xavier,et al.  Fast swept-volume distance for robust collision detection , 1997, Proceedings of International Conference on Robotics and Automation.

[31]  M. Iri,et al.  Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic , 1989 .

[32]  Mariette Yvinec,et al.  Efficient Exact Evaluation of Signs of Determinants , 1997, Symposium on Computational Geometry.

[33]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[34]  Chee-Keng Yap,et al.  Towards Exact Geometric Computation , 1997, Comput. Geom..

[35]  Chee-Keng Yap.  Symbolic Treatment of Geometric Degeneration , 1990, J. Symb. Comput..

[36]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[37]  Kenneth L. Clarkson,et al.  Safe and effective determinant evaluation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[38]  Stefan Schirra,et al.  Precision and Robustness in Geometric Computations , 1996, Algorithmic Foundations of Geographic Information Systems.