This paper introduces topological constraints to robustly and comprehensively process interference calculation in solid modeling and feature modeling, and describes a method of symbolic notation of their expressions and algorithms to handle them. The interference calculation should be processed consistently against the contradictions in numerical values and should output the result model in the same form of representation as that in the input. To satisfy this, the topological constraints are relied on in the processing rather than numerical values, and represented symbolically and explicitly in the solid model, which is based on the Face-based representation using a table of sequences of face names around each face of the solid. The topological constraints represent degeneracy and connectedness among faces, edges and vertices, and are used against errors derived from the ambiguities caused in the numerical calculation as well as in the input data, while the errors are deliberately kept within a given tolerance. The constraints are also specified by a designer for representing his intention. When the intersection is regarded as degenerate at a point such as vertex-vertex coincidence, its topological constraint is represented by a cluster of multiple basic intersection points between edges and faces, and the name of the cluster is expressed with face names around the degenerate point. In the calculation for the set operation, the symbols of cluster names and non-cluster intersection points are used to make intersection line loops, to divide the faces of both solids along the intersection lines and to reconnect the divided ones to make the result solid. Examples are shown to demonstrate that the algorithms generate output solids even when they are subtly intersected.

Issue Section:
Technical Papers
Keywords:
CAD, solid modelling, constraint theory, topology, Computer-Aided Design, Solid Modeling, Feature Modeling, Robust Computation, Topological Constraint, Face-Based Representation
Topics:
Algorithms, Errors, Solid modeling, Solid models, Solids, Topology, Ambiguity, Modeling, Construction, Wedges, Computer-aided design
1.
Sugihara, K., 1993,“Resolvable representation of polyhedra,” Proc. 2nd ACM Symposium on Solid Modeling, pp. 127–135.
2.
Benouamer, M., Michelucci, D., and Peroche, B., 1993, “Error-Free Boundary Evaluation Using Lazy Rational Arithmetic; A Detailed Implementation,” Proc. 2nd ACM Symposium on Solid Modeling, pp. 115–125.
3.
Banerjee R., and Rossignac, J R., 1996, “Topologically Exact Evaluation of Polyhedra Defined in CSG with Loose Primitives,” Computer Graphics Forum, 15, No. 4, pp. 205–217.
4.
Fortune, S., 1995, “Polyhedral modelling with Exact Arithmetic,” Proc. 3rd ACM Symposium on Solid Modeling, pp. 225–233.
5.
Sugihara K., and Iri, M., 1989, “A Solid Modeling System Free from Topological Inconsistency,” J. Information Processing, 12, No. 4, pp. 380-393.
6.
Agrawal A., and Requicha, A.A.G., 1994 “A Paradigm for the Robust Design of Algorithms for Geometric Modeling,” Computer Graphics Forum (EUROGRAPHICS ’94), 13, No. 3, pp C32-C44.
7.
Zhu, X., Fang, S., and Bru¨derlin, B. D., 1993, “Obtaining Robust Boolean Set Operations for Manifold Solids by Avoiding and Eliminating Redundancy,” Proc. 2nd ACM Symposium on Solid Modeling, pp. 147–154.
8.
Jackson, D. J., 1995, “Boundary Representation Modelling with Local Tolerances,” Proc. 3rd ACM Symposium on Solid Modeling, pp. 247–253.
9.
Segal, M., 1990, Using Tolerances to Guarantee Valid Polyhedral Modeling Results, Computer Graphics (Proc. SIGGRAPH’90), 24, No. 4, pp. 105–114.
10.
Higashi, M., Torihara, F., Takeuchi, N., Sata, T., Saitohm, T., and Hosaka, M., 1995, “Face-Based Data Structure and its Application to Robust Geometric Modeling,” Proc. 3rd ACM Synposium on Solid Modeling, pp. 235–246.
11.
Hoffman, C.M., Hopcroft J.E., and Karasick, M., 1989, “Robust Set Operations on Polyhedral Solids,” IEEE Computer Graphics and Applications, 9, (November), pp. 50–59.
12.
Sugihara, K., 1994 “A Robust and Consistent Algorithm for Intersecting Convex Polyhedra,” Computer Graphics Forum (EUROGRAPHICS ’94), 13, No. 3, pp. C45-C54.
13.
Nakamura, H., Higashi, M., and Hosaka, M., 1997, “Robust Computation of Intersection Graph Between Two Solids,” Computer Graphics Forum (EUROGRAPHICS ’97), 16, No. 3, pp. C79-C88 (1997).
14.
Ma¨ntyla¨, M., 1988, An Introduction to Solid Modeling, Computer Science Press.
15.
Sugihara
K.
and
Iri
,
M.
,
1992
, “
Construction of the Voronoi Diagram for “One Million” Generators in Single-Precision Arithmetic
,”
Proc. IEEE
,
80
, pp.
1471
–
1484
.
16.
Higashi, M., Senga, H., Nakamura, A., and Hosaka, M., 2000, “Parametric Design Method Based on Topological and Geometrical Constraints,” Proc. 7th IFIP WG5.2 Workshop on Geometric Modeling, Oct. 2–4, 2000, Parma, Italy, pp. 221–232.
Copyright © 2001
 by ASME
You do not currently have access to this content.