Use of Topological Constraints in Construction and Processing of Robust Solid Models

[+] Author and Article Information
Masatake Higashi, Hisashi Nakano, Atsuhide Nakamura, Mamoru Hosaka

Toyota Technological Institute 2-12-1, Hisakata, Tempaku-ku, Nagoya, 468-8511 Japan

J. Comput. Inf. Sci. Eng 1(4), 330-340 (Oct 01, 2001) (11 pages) doi:10.1115/1.1431548 History: Received September 01, 2001; Revised October 01, 2001
Copyright © 2001 by ASME
Your Session has timed out. Please sign back in to continue.


Sugihara, K., 1993,“Resolvable representation of polyhedra,” Proc. 2nd ACM Symposium on Solid Modeling, pp. 127–135.
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.
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.
Fortune, S., 1995, “Polyhedral modelling with Exact Arithmetic,” Proc. 3rd ACM Symposium on Solid Modeling, pp. 225–233.
Sugihara K., and Iri, M., 1989, “A Solid Modeling System Free from Topological Inconsistency,” J. Information Processing, 12 , No. 4, pp. 380-393.
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.
Zhu, X., Fang, S., and Brü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.
Jackson, D. J., 1995, “Boundary Representation Modelling with Local Tolerances,” Proc. 3rd ACM Symposium on Solid Modeling, pp. 247–253.
Segal, M., 1990, Using Tolerances to Guarantee Valid Polyhedral Modeling Results, Computer Graphics (Proc. SIGGRAPH’90), 24 , No. 4, pp. 105–114.
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.
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.
Sugihara, K., 1994 “A Robust and Consistent Algorithm for Intersecting Convex Polyhedra,” Computer Graphics Forum (EUROGRAPHICS ’94), 13 , No. 3, pp. C45-C54.
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).
Mäntylä, M., 1988, An Introduction to Solid Modeling, Computer Science Press.
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.
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.


Grahic Jump Location
An example of Face-based representation (F-rep)
Grahic Jump Location
Representation of non-manifold solids
Grahic Jump Location
Names of intersection points, in- and out-intersection lines
Grahic Jump Location
Intersection loop and divided face loops
Grahic Jump Location
Intersection between two sectors of solids
Grahic Jump Location
Relation of sectors for Edge-Face incidence
Grahic Jump Location
Relation of sectors for Edge-Edge coincidence
Grahic Jump Location
Virtual division of concave vertex: face 2 is divided virtually into 2-x and 2-y
Grahic Jump Location
Order of faces around the incident edge
Grahic Jump Location
Global intersection lines derived from symbols of basic intersection points
Grahic Jump Location
Cluster names for convex and concave Edge-cross
Grahic Jump Location
An example of cluster name for edge coincidence
Grahic Jump Location
Patterns of degeneracy (topological constraints)
Grahic Jump Location
Generation of consistent topological constraints
Grahic Jump Location
Examples of special degenerate cases
Grahic Jump Location
Examples of local structure at clusters
Grahic Jump Location
Modification of AFL in feature attachment
Grahic Jump Location
Patterns of feature generation according to coincident faces: (a) Sub,{(1,F),(2,R),(4,L),(6,U)}, {−1,−1,−1,−1}; (b) Sub,{(2,R),(4,L),(6,U)}, {−1,−1,−1}; (c) Sub,{(D,U1),(2,R1),(B,B1)}, {−1,−1,1}; (d) Add,{(D,D1),(B,B1),(F,F1),(6,U1)}, {−1,−1,1,1}; (e) Add,{(D,D1),(B,B1),(1,F1),(4,L1)}, {−1,−1,1,1}; (f ) Add,{(D,D1),(B,B1),(1,F1),(4,L1),(6,U1)}, {−1,−1,1,1,1}
Grahic Jump Location
Union of a cube and a rotated cube for different tolerance values
Grahic Jump Location
Union of two boxes intersected with small angles
Grahic Jump Location
Union of two boxes with roof-shaped faces intersecting with small angles
Grahic Jump Location
Set operations between concave solids



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In