Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

A Comment on ‘Constructing Regularity Feature Trees for Solid Models’

F. C. LangbeinContact Information, M. LiContact Information and R. R. MartinContact Information

(1)  School of Computer Science, Cardiff University, Cardiff, UK
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.

Contact Information F. C. Langbein
Email: F.C.Langbein@cs.cf.ac.uk

Contact Information M. Li
Email: M.Li@cs.cf.ac.uk

Contact Information R. R. Martin
Email: R.R.Martin@cs.cf.ac.uk
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.102 • Server: mpweb18
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)