## Detecting approximate symmetries of discrete point subsets (2008)

Citations: | 4 - 2 self |

### BibTeX

@MISC{Li08detectingapproximate,

author = {Ming Li and Frank C. Langbein and Ralph R. Martin},

title = { Detecting approximate symmetries of discrete point subsets },

year = {2008}

}

### OpenURL

### Abstract

Detecting approximate symmetries of parts of a model is important when attempting to determine the geometrical design intent of approximate boundary-representation (B-rep) solid models produced e.g. by reverse engineering systems. For example, such detected symmetries may be enforced exactly on the model to improve its shape, to simplify its analysis, or to constrain it during editing. We give an algorithm to detect local approximate symmetries in a discrete point set derived from a B-rep model: the output comprises the model’s potential local symmetries at various automatically detected tolerance levels. Non-trivial symmetries of subsets of the point set are found as unambiguous permutation cycles, i.e. vertices of an approximately regular polygon or an anti-prism, which are sufficiently separate from other points in the point set. The symmetries are detected using a rigorous, tolerance-controlled, incremental approach, which expands symmetry seed sets by one point at a time. Our symmetry cycle detection approach only depends on inter-point distances. The algorithm takes time O(n 4) where n is the number of input points. Results produced by our algorithm are demonstrated using a variety of examples.

### Citations

347 |
On Growth and Form
- Thompson
- 1917
(Show Context)
Citation Context ...manufactured objects exhibit global and local symmetries as a feature of their design or function, or for ease of manufacturing or analysis [1]. Furthermore, symmetry is also common in natural shapes =-=[2]-=- and designers prefer ⋆ Supported by EPSRC UK Grant GR/S69085/01 Email addresses: M.Li@cs.cf.ac.uk (Ming Li), F.C.Langbein@cs.cf.ac.uk (Frank C. Langbein), Ralph.Martin@cs.cf.ac.uk (Ralph R. Martin). ... |

120 |
Reverse Engineering of Geometric Models – An Introduction
- Varady
- 1997
(Show Context)
Citation Context ...ot exactly present, but only approximately present, due to measurement errors in the scanning process, and approximation and numerical errors in model reconstruction during reverse engineering system =-=[4]-=-. Different CAD systems often use different tolerances [5], and what is symmetric in one CAD system may not be symmetric in another. Explicit detection of symmetries in such geometric models has many ... |

120 | Partial and approximate symmetry detection for 3D geometry
- MITRA, GUIBAS, et al.
- 2006
(Show Context)
Citation Context ...ely symmetric subsets of a point set is an important topic not addressed by previous work. Here we are considering points which the symmetry maps in a one-to-one fashion onto each other. Mitra et al. =-=[15]-=- have considered the different problem of approximate maps of dense point clouds representing part of the surface of an object onto other dense point clouds from the same object— but these are not poi... |

101 | Congruence, similarity and symmetries of geometric objects
- Alt, Mehlhorn, et al.
- 1988
(Show Context)
Citation Context ...ely, approximate symmetry may be defined as existence of a transformation mapping the point set approximately onto itself within a certain tolerance; this yields high-order polynomial time algorithms =-=[22]-=- for symmetry detection. Mills et al [6] give a method for approximate global symmetry detection that combines the combinatorial and geometric nature of symmetries, resulting in a low-order polynomial... |

96 | Symmetry as a continuous feature
- Zabrodsky, Peleg, et al.
- 1995
(Show Context)
Citation Context ...al and geometric nature of symmetries, resulting in a low-order polynomial time algorithm. A completely different approach to detecting global approximate symmetries is to define an asymmetry measure =-=[28,29]-=-. Zabrodski [28] defines this as the minimum, taken over all exactly symmetric shapes with the desired symmetry, of the mean squared distance between points of the original shape and the symmetric sha... |

77 | A planar-reflective symmetry transform for 3D shapes
- PODOLAK, SHILANE, et al.
- 2006
(Show Context)
Citation Context ...this topic. (We again emphasise that we seek one-to-one correspondences between points, so our work is quite different from previous work on detecting local symmetries in images e.g. [9,12] or meshes =-=[14,15]-=- which use dense sets of points). The difficulties of the problem lie in choosing point subsets for consideration, inferring the symmetry transformations, and automatically determining the tolerance f... |

66 | 3d symmetry detection using the extended gaussian image - Sun, Sherrah - 1997 |

54 | Context-free attentional operators: The generalized symmetry transform - Reisfeld, Wolfson, et al. - 1995 |

47 | Detecting symmetry and symmetric constellations of features
- Loy, Eklundh
- 2006
(Show Context)
Citation Context ...s work addresses this topic. (We again emphasise that we seek one-to-one correspondences between points, so our work is quite different from previous work on detecting local symmetries in images e.g. =-=[9,12]-=- or meshes [14,15] which use dense sets of points). The difficulties of the problem lie in choosing point subsets for consideration, inferring the symmetry transformations, and automatically determini... |

38 |
Optimal algorithm for symmetry detection in two and three dimensions, The Visual Computer 1
- Wolter, Woo, et al.
- 1985
(Show Context)
Citation Context ...tecting exact, global symmetries of point sets and objects have been widely studied, e.g. [17,21–24]. Exact symmetry detection for planar collections of points and lines can be done in O(n logn) time =-=[21]-=-. Detecting symmetries of 3D point and line configurations, and polyhedra, has the same complexity [17,21]. The basic idea used is to sort the points according to distances from the centroid, and then... |

21 | Symmetry detection by generalized complex (GC) moments: a close-form solution - Shen, Ip, et al. - 1999 |

20 | Approximate symmetry detection for reverse engineering
- Mills, Langbein, et al.
(Show Context)
Citation Context ...g the symmetries intended by a designer in a B-rep model, but which are only approximately present. Our previous methods for geometric design intent detection can detect global approximate symmetries =-=[6]-=-, approximate congruencies between sub-parts [7], and other local regularities, e.g. parallel and orthogonal planes [8]. This paper considers a different issue not solved by such approaches: finding l... |

19 | Estimate of frequencies of geometric regularities for use in reverse engineering of simple mechanical components
- Mills, Langbein, et al.
- 2001
(Show Context)
Citation Context ...ry, design intent, reverse engineering. 1 Introduction Many manufactured objects exhibit global and local symmetries as a feature of their design or function, or for ease of manufacturing or analysis =-=[1]-=-. Furthermore, symmetry is also common in natural shapes [2] and designers prefer ⋆ Supported by EPSRC UK Grant GR/S69085/01 Email addresses: M.Li@cs.cf.ac.uk (Ming Li), F.C.Langbein@cs.cf.ac.uk (Fran... |

18 | On growth and form - DW - 1942 |

16 |
Towards the standardized exchange of parameterized feature-based CAD models, Computer-Aided Design 37
- Pratt, Anderson, et al.
- 2005
(Show Context)
Citation Context ... measurement errors in the scanning process, and approximation and numerical errors in model reconstruction during reverse engineering system [4]. Different CAD systems often use different tolerances =-=[5]-=-, and what is symmetric in one CAD system may not be symmetric in another. Explicit detection of symmetries in such geometric models has many potential uses: for example, to improve the shape of a mod... |

14 |
Geometric Symmetry
- Lockwood, Macmillan
- 1978
(Show Context)
Citation Context ... plane, i.e. vertices of an anti-prism. There are seven elementary symmetry transformations: reflection, inversion, translation, rotation, glide reflection, rotation reflection, and screw translation =-=[16]-=-. However, discounting inversion and reflection, only two other kinds— rotation and rotation reflection—have finite cycles (i.e. if we apply the symmetry operation enough times, the points go back to ... |

14 |
An n log n algorithm for determining the congruity of polyhedra
- Sugihara
- 1984
(Show Context)
Citation Context ...etries, both of this kind, and e.g. incomplete rotational symmetries, is not straightforward and will also be addressed in future work. Although exact symmetry detection has been widely studied, e.g. =-=[17,18]-=-, these 4 methods cannot be directly extended to approximate symmetries by simply replacing tests for equality by tests for approximate equality. Algorithms for exact symmetry detection rely on making... |

13 | Choosing consistent constraints for beautification of reverse engineered geometric models, Computer-Aided Design 36 (3
- Langbein, Marshall, et al.
- 2004
(Show Context)
Citation Context ...s for geometric design intent detection can detect global approximate symmetries [6], approximate congruencies between sub-parts [7], and other local regularities, e.g. parallel and orthogonal planes =-=[8]-=-. This paper considers a different issue not solved by such approaches: finding local approximate symmetries in a B-rep model. For example, the model in Fig. 1 has cylindrical holes arranged with an e... |

13 |
Comments on ’symmetry as a continuous feature
- Kanatani
- 1997
(Show Context)
Citation Context ...esses which use the symmetries, e.g. to beautify reverse engineered models by solving geometric constraint systems [8,19] or other applications for further selection between these detected symmetries =-=[20]-=-. After symmetries at certain tolerances have been detected it is simpler to select suitable symmetries at suitable tolerances. Based on the definition of global approximate symmetries given in [6], w... |

13 | Sillion, Accurate detection of symmetries in 3D shapes - Martinet, Soler, et al. - 2006 |

11 |
Testing approximate symmetry in the plane is NP-hard
- Iwanowski
- 1991
(Show Context)
Citation Context ...implementation finds mirror planes of symmetry. Most previous work on approximate symmetries has considered global approximate symmetries, using various definitions of approximate symmetry. Iwanowski =-=[27]-=- pointed out that testing approximate symmetry in the plane is NP-hard if approximate symmetry is defined in terms of the existence of an exactly symmetric object near to the approximate object. Alter... |

10 | Approximate congruence detection of model features for reverse engineering - Gao, Langbein, et al. |

10 | A C-tree decomposition algorithm for 2D and 3D geometric constraint solving, Computer-Aided Design 38 - Gao, Lin, et al. - 2006 |

8 |
Testing congruence and symmetry for general 3dimensional objects, Computational Geometry 27
- Brass, Knauer
- 2004
(Show Context)
Citation Context ...cording to distances from the centroid, and then to check how many there are at each distance, which essentially reduces the complexity of the problem to that of a sorting algorithm. Brass and Knauer =-=[24]-=- recently extended the idea to general 3D objects. 6 There are relatively few results on exact symmetries of subsets. Brass [18] detects rotational symmetries by finding rotational mappings based on i... |

7 | AVNIR D.: Symmetry as a continuous feature - ZABRODSKY, PELEG - 1995 |

7 | Constructing regularity feature trees for solid models
- Li, Langbein, et al.
- 2006
(Show Context)
Citation Context ... a large number of unambiguous cycles. To increase the speed of the algorithm, as well as the usefulness of the answers, we suggest that feature detection algorithms, such as regularity feature trees =-=[30]-=-, may help to reduce the complexity of the problem for practical use, by dividing the input into several smaller subproblems. 8 Experiments In this section we present various examples of using our app... |

6 | Yeshurun Y. Context-free attentional operators: The generalized symmetry transform - Reisfeld, Wolfson - 1995 |

6 |
On finding maximum-cardinality symmetric subsets, Computational Geometry 24
- Brass
- 2003
(Show Context)
Citation Context ...etries, both of this kind, and e.g. incomplete rotational symmetries, is not straightforward and will also be addressed in future work. Although exact symmetry detection has been widely studied, e.g. =-=[17,18]-=-, these 4 methods cannot be directly extended to approximate symmetries by simply replacing tests for equality by tests for approximate equality. Algorithms for exact symmetry detection rely on making... |

6 | Tools for asymmetry rectification in shape design
- Martin, Dutta
- 1996
(Show Context)
Citation Context ...al and geometric nature of symmetries, resulting in a low-order polynomial time algorithm. A completely different approach to detecting global approximate symmetries is to define an asymmetry measure =-=[28,29]-=-. Zabrodski [28] defines this as the minimum, taken over all exactly symmetric shapes with the desired symmetry, of the mean squared distance between points of the original shape and the symmetric sha... |

5 | Detection of rotational and involutional symmetries and congruity of polyhedra, The Visual Computer 12 (4 - Jiang, Yu, et al. - 1996 |

4 | Shilane P, Golovinskiy A, Rusinkiewicz S, Funkhouser T. A planar-reflective symmetry transform for 3d shapes - Podolak |

2 | Logic and design in art, science and mathematics - Barratt - 1989 |

2 | Holzschuch N, Sillion FX. Accurate detection of symmetries in 3D shapes - Martinet, Soler |

2 | Where to build a temple, and where to find one. In: 22nd European workshop on computational geometry - Aloupis, Cardinal, et al. - 2006 |

2 |
Recognising symmetry in solid models, Computer-Aided Design 35 (7
- Tate, Jared
- 2003
(Show Context)
Citation Context ...mbining mirror planes generated by point pairs. This work was improved by Aloupis [25] using a randomised approach. Another approach to finding subset symmetries in solid models was presented by Tate =-=[26]-=-. It is based on matching pairs of edge loops and finding the isometries that relate them. The isometries are then grouped according to similarity. Their implementation finds mirror planes of symmetry... |

1 |
Where to build a temple, and where to find one
- Aloupis, Cardinal, et al.
(Show Context)
Citation Context ...es them into symmetric subsets efficiently using a tree data structure. Mirror symmetries can easily be detected by combining mirror planes generated by point pairs. This work was improved by Aloupis =-=[25]-=- using a randomised approach. Another approach to finding subset symmetries in solid models was presented by Tate [26]. It is based on matching pairs of edge loops and finding the isometries that rela... |