TURNING SHAPE DECISION PROBLEMS INTO MEASURES
From MaRDI portal
Publication:4669615
DOI10.1142/S0218654304000614zbMath1067.68165OpenAlexW2036682391MaRDI QIDQ4669615
Ralph R. Martin, Paul L. Rosin
Publication date: 15 April 2005
Published in: International Journal of Shape Modeling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218654304000614
symmetrystabilityconvexitysimilarityholegenuscongruenceellipticityresemblancecontainmentrectangularitycircularityshape propertiestriangularity2.5DrectilinearityShape measures
Related Items (1)
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
This page was built for publication: TURNING SHAPE DECISION PROBLEMS INTO MEASURES