ACM Home Page
Please provide us with feedback. Feedback
Detecting approximate incomplete symmetries in discrete point sets
Full text PdfPdf (275 KB)
Source
ACM Symposium on Solid and Physical Modeling archive
Proceedings of the 2007 ACM symposium on Solid and physical modeling table of contents
Beijing, China
SESSION: Short papers table of contents
Pages: 335 - 340  
Year of Publication: 2007
ISBN:978-1-59593-666-0
Authors
M. Li  Cardiff University, UK
F. C. Langbein  Cardiff University, UK
R. R. Martin  Cardiff University, UK
Sponsor
Tsinghua University : Tsinghua University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 32,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1236246.1236294
What is a DOI?

ABSTRACT

Motivated by the need to detect design intent in approximate boundary representation models, we give an algorithm to detect incomplete symmetries of discrete points, giving the models' potential local symmetries at various automatically detected tolerances. Here, incomplete symmetry is defined as a set of incomplete cycles which are constructed by, e.g., a set of consecutive vertices of an approximately regular polygon, induced by a single isometry. All seven 3D elementary isometries are considered for symmetry detection. Incomplete cycles are first found using a tolerance-controlled point expansion approach. Subsequently, these cycles are clustered for incomplete symmetry detection. The resulting clusters have welldefined, unambiguous approximate symmetries suitable for design intent detection, as demonstrated experimentally.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Barratt, K. 1989. Logic and Design in Art, Science and Mathematics. Herbet Press, London.
 
3
 
4
 
5
 
6
 
7
Gao, X., Lin, Q., and Zhang, G. 2006. A C-tree decomposition algorithm for 2D and 3D geometric constraint solving. Computer-Aided Design 38, 1, 1--13.
 
8
 
9
Langbein, F., Marshall, A., and Martin, R. 2004. Choosing consistent constraints for beautification of reverse engineered geometric models. Computer-Aided Design 36, 3, 261--278.
 
10
Li, M., Langbein, F., and Martin, R. 2006. Detecting approximate symmetries of discrete point subsets. submitted.
11
 
12
Mills, B., Langbein, F., Marshall, A., and Martin, R. 2001. Estimate of frequencies of geometric regularities for use in reverse engineering of simple mechanical components. Tech. Rep. GVG 2001-1, Cardiff University. http://ralph.cs.cf.ac.uk/papers/Geometry/survey.pdf
13
14
 
15
Robins, G., Robinson, B., and Sethi, B. 1999. On detecting spatial regularity in noisy images. Information Processing Letters 69, 189--195.
 
16
Sugihara, K. 1984. An nlogn algorithm for determining the congruity of polyhedra. Journal of Computer and System Sciences 29, 11, 36--47.
 
17
 
18
Tate, S., and Jared, G. 2003. Recognising symmetry in solid models. Computer-Aided Design 35, 7, 673--692.
 
19
Varady, T., Martin, R., and Cox, J. 1997. Reverse engineering of geometric models - an introduction. Computer-Aided Design 29, 4, 255--268.
 
20
Weyl, H. 1952. Symmetry. Princeton University Press.
 
21

Collaborative Colleagues:
M. Li: colleagues
F. C. Langbein: colleagues
R. R. Martin: colleagues