CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n
Authors
Dania El-Khechen
Thomas T. Fevens
John Iacono
Publication date
1 January 2006
Publisher
Abstract
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, August 14-16, 2006, Queen's University, Ontario, Canadainfo:eu-repo/semantics/publishe
Similar works
Full text
Available Versions
DI-fusion
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dipot.ulb.ac.be:2013/32628...
Last time updated on 28/10/2021