Skip to search formSkip to main contentSkip to account menu

Lazy caterer's sequence

Known as: Central polygonal numbers, Circle cutting problem, A000124 
The lazy caterer's sequence, more formally known as the central polygonal numbers, describes the maximum number of pieces of a circle (a pancake or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered fragments, is… 
2018
2018
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was… 
2016
2016
This paper discusses approximations of continuous and mixed-integer non-linear optimization problems via piecewise linear… 
2011
2011
Das Luftfahrt-Catering ist ein stetig, global wachsender Markt mit vielen Unternehmensubergreifenden Prozessen. Um… 
2011
2011
Developing an Employee Training Addendum for a Sustainable Hospitality Operation by Devon A. Williams Robert Woods, Committee… 
2007
2007
Circular blanks are often cut from silicon steel plates to make stators and rotors of electric motors. The shearing and punching… 
2007
2007
This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the…