Convex Polygons Are Cover-Decomposable

Discrete and Computational Geometry - United States
doi 10.1007/s00454-009-9133-y
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Octants Are Cover-Decomposable

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2011English

Dissections of Polygons Into Convex Polygons

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2010English

Reconfiguring Convex Polygons

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2001English

Tilings of Convex Polygons

Annales de l'Institut Fourier
GeometryTopologyNumber TheoryAlgebra
1997English

The Morphology of Convex Polygons

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1992English

Remark on Ozeki Inequality for Convex Polygons

Journal of Mathematical Inequalities
Analysis
2013English

On Asymptotic Algorithms for Approximating Arbitrary Polygons by Simpler Convex Polygons.

English

Schur Convex Functions and the Bonnesen Style Isoperimetric Inequalities for Planar Convex Polygons

Journal of Mathematical Inequalities
Analysis
2018English

On the Relative Lengths of Sides of Convex Polygons

Studia Scientiarum Mathematicarum Hungarica
Mathematics
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy