Efficient regular polygon dissections
type: Item
instance of: scholarly article
title: Efficient regular polygon dissections
zbMATH Open document ID: 0956.68115
DOI: 10.1023/A:1005292125553
author: Evangelos Kranakis
author: D. Krizanc
author: J. Urrutia
published in: Geometriae Dedicata
publication date: 2000-10-23T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 52B45
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1485588
zbMATH Keywords: regular polygon-square dissections
zbMATH Keywords: polygonal cuts
zbMATH Keywords: regular polygon-polygon dissections
MaRDI profile type: Publication
full work available at URL: a:1005292125553
OpenAlex ID: W48700190
Recommended article: Q4504023
Recommended article: EFFICIENT APPROXIMATION OF CONVEX POLYGONS
Recommended article: A fast algorithm for polygon operations
Recommended article: DISSECTIONS OF POLYGONS INTO CONVEX POLYGONS
Recommended article: Approximate convex decomposition of polygons
Recommended article: Polygon decomposition for efficient construction of Minkowski sums
Recommended article: Q2753919
Recommended article: Efficient algorithm for transversal of disjoint convex polygons.
description: scientific article; zbMATH DE number 1485588