ESOLID - A system for exact boundary evaluation

Abstract We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using exact representations and exact computations throughout. The demands of exact computation require a different set of algorithms and efficiency improvements than those found in a traditional inexact floating-point based modeler. We describe the system architecture, representations, and issues in implementing the algorithms. We also describe a number of techniques that increase the efficiency of the system based on lazy evaluation, use of floating-point filters, arbitrary floating-point arithmetic with error bounds, and lower-dimensional formulation of subproblems. ESOLID has been used for boundary evaluation of many complex solids. These include both synthetic datasets and parts of a Bradley Fighting Vehicle designed using the BRL-CAD solid modeling system. It is shown that ESOLID can correctly evaluate the boundary of solids that are very hard to compute using a fixed-precision floating-point modeler. In terms of performance, it is about an order of magnitude slower as compared to a floating-point boundary evaluation system on most cases.

[1]  Mark Segal,et al.  Using tolerances to guarantee valid polyhedral modeling results , 1990, SIGGRAPH.

[2]  Shiaofen Fang,et al.  Robustness in solid modelling: a tolerance-based intuitionistic approach , 1993, Comput. Aided Des..

[3]  Steven Fortune,et al.  Polyhedral modelling with multiprecision integer arithmetic , 1997, Comput. Aided Des..

[4]  Elmar Schömer,et al.  Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually! , 2001, SCG '01.

[5]  Nicholas M. Patrikalakis,et al.  Robust interval solid modelling Part II: boundary evaluation , 1996, Comput. Aided Des..

[6]  J. Calmet.  Computer Algebra , 1982 .

[7]  Dinesh Manocha,et al.  Eecient and Accurate B-rep Generation of Low Degree Sculptured Solids Using Exact Arithmetic:i - Representations , 1999 .

[8]  I. C. Braid,et al.  The synthesis of solids bounded by many faces , 1975, Commun. ACM.

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

[10]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

[11]  Kokichi Sugihara.  A Robust and Consistent Algorithm for Intersecting Convex Polyhedra , 1994, Comput. Graph. Forum.

[12]  Dinesh Manocha,et al.  Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic: II - computation , 1999, Comput. Aided Geom. Des..

[13]  Nicholas M. Patrikalakis,et al.  Robust interval solid modelling Part I: representations , 1996, Comput. Aided Des..

[14]  Dinesh Manocha,et al.  Accurate computation of the medial axis of a polyhedron , 1999, SMA '99.

[15]  Chee Yap,et al.  The exact computation paradigm , 1995 .

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

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

[18]  D. Du,et al.  Computing in Euclidean Geometry , 1995 .

[19]  Bernard Péroche,et al.  Error-free boundary evaluation based on a lazy rational arithmetic: a detailed implementation , 1994, Comput. Aided Des..

[20]  Norimasa Yoshida,et al.  Solid Modeling Based on a New Paradigm , 1994, Comput. Graph. Forum.

[21]  Jonathan Richard Shewchuk,et al.  Robust adaptive floating-point geometric predicates , 1996, SCG '96.

[22]  Christoph M. Hoffmann,et al.  The problems of accuracy and robustness in geometric computation , 1989, Computer.

[23]  Dinesh Manocha,et al.  Exact boundary evaluation for curved solids , 2000 .

[24]  Jeremy R. Johnson,et al.  Real algebraic number computation using interval arithmetic , 1992, ISSAC '92.

[25]  A.A.G. Requicha,et al.  Boolean operations in solid modeling: Boundary evaluation and merging algorithms , 1985, Proceedings of the IEEE.

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

[27]  Dinesh Manocha,et al.  BOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids , 2001, Int. J. Comput. Geom. Appl..

[28]  Dinesh Manocha,et al.  Efficient and exact manipulation of algebraic points and curves , 2000, Comput. Aided Des..

[29]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[30]  Dinesh Manocha,et al.  ESOLID---A System for Exact Boundary Evaluation , 2002, SMA '02.

[31]  Jiaxun Yu.  Exact arithmetic solid modeling , 1992 .

[32]  Lee R. Nackman,et al.  Efficient Delaunay triangulation using rational arithmetic , 1991, TOGS.

[33]  D. Manocha,et al.  Efficient and accurate boundary evaluation algorithms for boolean combinations of sculptured solids , 1997 .

[34]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[35]  Dinesh Manocha,et al.  PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation , 2001, SCG '01.

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

[37]  James E. Bobrow,et al.  A set operation algorithm for sculptured solids modeled with trimmed patches , 1989, Comput. Aided Geom. Des..

[38]  John E. Hopcroft,et al.  Robust set operations on polyhedral solids , 1987, IEEE Computer Graphics and Applications.

[39]  Neil F. Stewart,et al.  Semantic interpretation of inconsistent curve and surface data for the definition of solids , 1992 .

[40]  Christopher J. Van Wyk,et al.  Efficient exact arithmetic for computational geometry , 1993, SCG '93.

[41]  Dinesh Manocha,et al.  Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic , 1997, SMA '97.

[42]  Oliver Aberth,et al.  Precise computation using range arithmetic, via C++ , 1992, TOMS.

[43]  Paul H Deitz,et al.  An Integrated Environment for Army, Navy and Air Force Target Description Support , 1989 .

[44]  Johannes Buchmann,et al.  LiDIA : a library for computational number theory , 1995 .

[45]  Chee-Keng Yap,et al.  A core library for robust numeric and geometric computation , 1999, SCG '99.