Abstract
In [2] we presented an algorithm for decomposing a boundary representation model hierarchically into regularity features by recovering broken symmetries. The algorithm adds new recoverable edges and faces, which can be constructed from existing geometry. This generates positive and negative volumes giving simple, more symmetric sub-parts of the model. The resulting regularity feature tree may be utilised for regularity detection to describe a model’s design intent in terms of regularities such as symmetries and congruencies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Leyton, M. (ed.): A Generative Theory of Shape. LNCS, vol. 2145. Springer, Heidelberg (2001)
Li, M., Langbein, F.C., Martin, R.R.: Constructing Regularity Feature Trees for Solid Models. In: Kim, M.-S., Shimada, K. (eds.) GMP 2006. LNCS, vol. 4077, pp. 267–286. Springer, Heidelberg (2006)
Shapiro, V., Vossler, D.: Separation for boundary to CSG conversion. ACM Trans. Graphics 12(1), 35–55 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Langbein, F.C., Li, M., Martin, R.R. (2008). A Comment on ‘Constructing Regularity Feature Trees for Solid Models’. In: Chen, F., Jüttler, B. (eds) Advances in Geometric Modeling and Processing. GMP 2008. Lecture Notes in Computer Science, vol 4975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79246-8_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-79246-8_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79245-1
Online ISBN: 978-3-540-79246-8
eBook Packages: Computer ScienceComputer Science (R0)