research-article

Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents

Author:

John R. WoodwarkAuthors Info & Claims

IEEE Computer Graphics and Applications, Volume 8, Issue 3

Pages 38 - 47

https://doi.org/10.1109/38.512

Published: 01 May 1988 Publication History

Publisher Site

Abstract

Set-theoretic solid models often contain redundant primitives, which slow down rendering and other processes. They are not simple to remove, especially as there can be alternative eliminations that may not be equally desirable. Existing techniques for eliminating such redundant primitives do not fully consider the possibilities and rely on repeated evaluation of parts of the object's boundary, a process that is likely to be very slow. A technique that allows alternative eliminations to be examined is proposed and a potentially efficient, but geometrically approximate, method of implementation is outlined.

References

[1]

1. A.A.G. Requicha, "Representations of Rigid Solids: Theory, Methods and Systems," ACM Computing Surveys, Dec. 1980, pp. 437-464.

Crossref

Google Scholar

[2]

2. J.R. Woodwark and K.M. Quinlan, "The Derivation of Graphics from Volume Models by Recursive Subdivision of the Object Space," Proc. Computer Graphics 80 Conf., Online, London, 1980, pp. 335-343.

Google Scholar

[3]

3. J.R. Woodwark and A. Bowyer, "Better and Faster Pictures from Solid Models," Computer-Aided Engineering J., Feb. 1986, pp. 17-24.

Google Scholar

[4]

4. J.R. Woodwark, "Some Speculations on Feature Recognition," To be published in Computer-Aided Design, May 1988.

Crossref

Google Scholar

[5]

5. A.A.G. Requicha and H.B. Voelcker, "Boolean Operations in Solid Modelling: Boundary Evaluation and Merging Algorithms," Tech. Memo TM-26, Production Automation Project, Univ. of Rochester, Rochester, N.Y., 1984.

Google Scholar

[6]

6. R.B. Tilove, "Exploiting Spatial and Structural Locality in Geometric Modelling," Tech. Memo TM-38, Production Automation Project, Univ. of Rochester, Rochester, N.Y., 1981.

Google Scholar

[7]

7. R.B. Tilove, "A Null Object Detection Algorithm for Constructive Solid Geometry," CACM, July 1984, pp. 684-694.

Crossref

Google Scholar

[8]

8. J.R. Rossignac and H.B. Voelcker, "Active Zones in Constructive Solid Geometry for Redundancy and Interference Detection," Research Report RC T1991, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1986.

Google Scholar

[9]

9. A.R. Halbert, S.J.P. Todd, and J.R. Woodwark, "Generalizing Active Zones for Set-Theoretic Solid Models," To be published in Computer J., June 1988.

Crossref

Google Scholar

[10]

10. K. Kuratowski and A. Moskowski, Set Theory, North Holland, Amsterdam, and PWN, Warsaw, 1976.

Google Scholar

[11]

11. A.F. Wallis and J.R. Woodwark, "Creating Large Solid Models for NC Toolpath Verification," Proc. CAD 84 Conf., Butterworths, Guildford, UK, 1984, pp. 455-460.

Google Scholar

[12]

12. J.R. Woodwark, "Generating Wireframes from Set-Theoretic Solid Models by Spatial Division," Computer-Aided Design, July/Aug. 1986, pp. 307-315.

Crossref

Google Scholar

Cited By

View all

Banerjee RGoel VMukherjee A(1993)Efficient parallel evaluation of CSG tree using fixed number of processorsProceedings on the second ACM symposium on Solid modeling and applications10.1145/164360.164409(137-146)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/164360.164409
Rappoport A(1991)The n-dimensional extended convex differences tree (ECDT) for representing polyhedraProceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications10.1145/112515.112538(139-147)Online publication date: 1-May-1991
https://dl.acm.org/doi/10.1145/112515.112538
Burridge JCollins BHeywood TLatham WPhippen RQuarendon PReilly PRicketts MSimmons JTodd SWalter AWoodwark J(1989)The WINSOM solid modeller and its application to data visualizationIBM Systems Journal10.1147/sj.284.054828:4(548-568)Online publication date: 10-Nov-1989
https://dl.acm.org/doi/10.1147/sj.284.0548

Index Terms

Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents

Recommendations

A New Method for Eliminating Redundant Association Rules
ICICTA '10: Proceedings of the 2010 International Conference on Intelligent Computation Technology and Automation - Volume 01

As one of the fundamental data mining methods, the association rule mining has widely been used in many fields. However, the existence of massive redundant rules has made the analysis very difficult, and has been a main barrier to efficient utilization ...
A Vehicular Task Offloading Method With Eliminating Redundant Tasks in 5G HetNets
The combination of mobile edge computing and 5G heterogeneous networks (5G HetNets) provides new vehicular task offloading research solutions. Most existing task offloading studies assume that vehicle tasks are unique and there are no redundant tasks ...
Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set

Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant digit set. We present here an ...

Reviews

Reviewer: Sandu Crivineanu

Solid modelers are in everyday practical use for engineering applications because of their reduced computing costs, improved user interfaces, and software refinements. Most solid modeling programs fall into one of two broad categories that define how the models are constructed: constructive solid geometry (CSG) and boundary representation. In a CSG model, which this paper calls a set-theoretic model, volumes are described by a number of primitive solids that are related by a set-theoretic expression. In spite of their numerical stability, set-theoretic models often have the disadvantage that they are not unique representations of an object. They also contain redundant primitives that cause many difficulties in processing; the geometric definition of an object, for example, is more complicated than is necessary. The author clearly indicates the subject area of this paper: “This article has merely shown how an analysis of constituents may be used to investigate the choices available in replacing redundant primitives by the empty or universal sets. In essence, the approach proposed is a simple analysis of constituents backed up by techniques to control the explosive proliferation of data that occurs if the method is applied directly.” Based on the robust framework of constituents, Woodwark has done an outstanding job of encapsulating his work in an informative and insightful style. Using an example and a series of 13 figures, the author is careful to point out the disadvantages and limitations of his technique as well as the advantages and opportunities it affords. The references provide a good guide to the context within which the work is set. The presentation assumes an advanced reader with detailed knowledge about the existing techniques for eliminating redundant primitives. Maybe more details about the author's experience with the two-dimensional Prolog implementation of his algorithm would help the reader. The paper is an interesting and worthwhile contribution toward improving the computability of the set-theoretic solid model.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

cover image IEEE Computer Graphics and Applications

IEEE Computer Graphics and Applications Volume 8, Issue 3

May 1988

67 pages

ISSN:0272-1716

Editor:
John Staudhammer
Univ. of Florida, Gainesville

Issue’s Table of Contents

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 May 1988

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Banerjee RGoel VMukherjee A(1993)Efficient parallel evaluation of CSG tree using fixed number of processorsProceedings on the second ACM symposium on Solid modeling and applications10.1145/164360.164409(137-146)Online publication date: 1-Jun-1993
https://dl.acm.org/doi/10.1145/164360.164409
Rappoport A(1991)The n-dimensional extended convex differences tree (ECDT) for representing polyhedraProceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications10.1145/112515.112538(139-147)Online publication date: 1-May-1991
https://dl.acm.org/doi/10.1145/112515.112538
Burridge JCollins BHeywood TLatham WPhippen RQuarendon PReilly PRicketts MSimmons JTodd SWalter AWoodwark J(1989)The WINSOM solid modeller and its application to data visualizationIBM Systems Journal10.1147/sj.284.054828:4(548-568)Online publication date: 10-Nov-1989
https://dl.acm.org/doi/10.1147/sj.284.0548

Abstract

References

Cited By

Index Terms

Recommendations

A New Method for Eliminating Redundant Association Rules

A Vehicular Task Offloading Method With Eliminating Redundant Tasks in 5G HetNets

Further Reducing the Redundancy of a Notation Over a Minimally Redundant Digit Set

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations