Measuring regularity of convex polygons
Explore this paper's citation graph
Summary
Several measures to evaluate to which extent the shape of a given convex polygon is close to be regular are proposed, focusing on a range of characteristics of regularity: optimal ratio area-perimeter, equality of angles and edge lengths, regular fitting, angular and areal symmetry.
- Type
- article
- Published
- 2013-02-01
- Cited by
- 17
- References
- 12
- OpenAlex
- https://openalex.org/W2013545179
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9868135
Keywords
Polygon (computer graphics), Regular polygon, Computation, Perimeter, Convex polygon
References
- Introduction to Algorithms, third edition
- A characterization of the convexity of cyclic polygons in terms of the central angles
- Largest Placement of One Convex Polygon Inside Another
- Linear Programming in Linear Time When the Dimension Is Fixed
- Computing deviations from convexity in polygons
- Cyclic polygons with given edge lengths: Existence and uniqueness
- A new convexity measure for polygons
- Where to build a temple, and where to dig to find one
- Regular polygon detection
- Similarity and Symmetry Measures for Convex Shapes Using Minkowski Addition
- Davenport-Schinzel sequences and their geometric applications
- Introduction to Algorithms
- A robust method for road sign detection and recognition
- Computational geometry. an introduction
Cited by
- Automated geometrical evaluation of a plaza (town square)
- Grasp planning via hand-object geometric fitting
- Extraction des bulles de bandes dessinées
- Algorithms and Criteria for Volumetric Centroidal Voronoi Tessellations. (Algorithmes et Critères pour les Tessellations Volumétriques de Voronoi Centroïdales)
- A heuristic convexity measure for 3D meshes
- QuantifyPolarity, a new tool-kit for measuring planar polarized protein distributions and cell properties in developing tissues
- A novel quantitative measurement method for irregular tubules in breast carcinoma
- A sharp Poincaré inequality for functions in 𝐖^1,∞(Ω;ℝ)
- Mesh quality agglomeration algorithm for the virtual element method applied to discrete fracture networks
- A Survey of Indicators for Mesh Quality Assessment
- Mesh Optimization for the Virtual Element Method: How Small Can an Agglomerated Mesh Become?
- Mesh Quality Meets The Virtual Element Method
- Spontaneous vortex crystal formation in classical rotating flows
- Text-Independent Speech Balloon Segmentation for Comics and Manga
- Measuring regularity of convex polygons : experimental results
- Analysis and Modeling of Polygonality in Retinal Tissue Based on Voronoi Diagram and Delaunay Tessellations
- Evaluation of the Quality of an Urban Square
- Spontaneous vortex crystal formation in classical rotating flows
Related papers
- Area and perimeter foliations on spaces of polygons
- Establishment of flight rerouting area and air route planning based on convex polygon
- DEVELOPMENT OF A METHOD AND ALGORITHMS OF CALCULATION OF THE AREA OF A CONVEX POLYGON WITH THE USE OF COMBINATORICS
- Planar polygons; Regular, convex, almost convex, staircase and row convex
- An improved method for calculating the no-fit polygon
- Convex lattice polygons of fixed area with perimeter-dependent weights.
- Maximal perimeter and maximal width of a convex small polygon
- General method of Complex Polynomial for determining the radius of the circle circumscribed to a cyclic polygon an arbitrary number of sides, and some important consequences