TURNING SHAPE DECISION PROBLEMS INTO MEASURES
From MaRDI portal
Publication:4669615
DOI10.1142/S0218654304000614zbMath1067.68165MaRDI QIDQ4669615
Ralph R. Martin, Paul L. Rosin
Publication date: 15 April 2005
Published in: International Journal of Shape Modeling (Search for Journal in Brave)
symmetry; stability; convexity; similarity; hole; genus; congruence; ellipticity; resemblance; containment; rectangularity; circularity; shape properties; triangularity; 2.5D; rectilinearity; Shape measures
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Cites Work
- Unnamed Item
- Using low-discrepancy sequences and the Crofton formula to compute surface areas of geometric models
- Optimal algorithms for finding the symmetries of a planar point set
- Recognition of form features using convex decomposition
- On the use of size functions for shape analysis
- Optimal algorithms for symmetry detection in two and three dimensions
- An optimal algorithm for finding minimal enclosing triangles
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Computing deviations from convexity in polygons
- Polygonal entropy: A convexity measure
- Geometry helps in bottleneck matching and related problems