Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Finding approximate shape regularities in reverse engineered solid models bounded by simple surfaces

Langbein, Frank Curd ORCID: https://orcid.org/0000-0002-3379-0323, Mills, Bruce I., Marshall, Andrew David ORCID: https://orcid.org/0000-0003-2789-1395 and Martin, Ralph Robert 2001. Finding approximate shape regularities in reverse engineered solid models bounded by simple surfaces. Presented at: ACM Symposium on Solid and Physical Modeling, Ann Arbor, MI, USA, 4-8 June 2001. Published in: Anderson, D. C. ed. Proceedings of the sixth ACM symposium on Solid modeling and applications (SMA '01). New York: ACM, pp. 206-215. 10.1145/376957.376981

Full text not available from this repository.

Abstract

Current reverse engineering systems are able to generate simple valid boundary representation (B-rep) models from 3D range data. Such models suffer from various inaccuracies caused by noise in the input data and algorithms. The quality of reverse engineered geometric models can potentially be improved by finding candidate shape regularities in such an initial model, and imposing a suitable subset of them on the model by using constraints, in a postprocessing step called beautification. Finding such candidate regularities is a necessary first step, and is discussed in this paper. Algorithms for analysis are presented which use feature objects to describe properties of faces, edges and vertices, and small groups of these elements in a B-rep model with only planar, spherical, cylindrical, conical and toroidal faces. The methods seek similarities between feature objects, e.g. axes which are parallel, for each property type. For each group of similar feature objects they also try to find a special feature object which might represent the group, e.g. an integer value which approximates the radius of similar cylinders. The feature objects used represent shape parameters, directions, axes and positions present in the model. Experiments show that the regularities found by these algorithms include the desired regularities. Although other spurious regularities which must be discarded in subsequent beautification steps are also produced, their number can be reduced by appropriate choice of tolerance values.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: ACM
ISBN: 1581133669
Last Modified: 07 Nov 2022 08:22
URI: https://orca.cardiff.ac.uk/id/eprint/31751

Citation Data

Cited 17 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item