Detecting approximate incomplete symmetries in discrete point sets

  • Authors:
  • M. Li;F. C. Langbein;R. R. Martin

  • Affiliations:
  • Cardiff University, UK;Cardiff University, UK;Cardiff University, UK

  • Venue:
  • Proceedings of the 2007 ACM symposium on Solid and physical modeling
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.