Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and Craig S. Kaplan, “Polygons Cuttable by a Circular Saw”, in Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG 2000), Fredericton, New Brunswick, Canada, August 16–18, 2000, pages 1–6.

BibTeX

@InProceedings{CCCG2000a,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Craig S. Kaplan},
  TITLE         = {Polygons Cuttable by a Circular Saw},
  BOOKTITLE     = {Proceedings of the 12th Annual Canadian Conference on
                   Computational Geometry (CCCG 2000)},
  BOOKURL       = {http://www.cs.unb.ca/conf/cccg/},
  MONTH         = {August 16--18},
  YEAR          = 2000,
  ADDRESS       = {Fredericton, New Brunswick, Canada},
  PAGES         = {1--6},

  award         = {Invited to a special issue of \emph{Computational Geometry: Theory and Applications}.},
  length        = {6 pages; 25 minutes},
  papers        = {CircularSawCGTA},
  dblp          = {https://dblp.org/rec/conf/cccg/DemaineDK00},
  ee            = {http://www.cccg.ca/proceedings/2000/36.ps.gz},
  comments      = {This paper is also available from the
                   <A HREF="http://www.cs.unb.ca/conf/cccg/eProceedings/">
                   electronic proceedings</A> as
                   <A HREF="http://www.cs.unb.ca/conf/cccg/eProceedings/36.ps.gz">http://www.cs.unb.ca/conf/cccg/eProceedings/36.ps.gz</A>.},
  unrefereed    = 1,
}

Abstract:

We introduce and characterize a new class of polygons that models wood, stone, glass, and ceramic shapes that can be cut with a table saw, lapidary trim saw, or other circular saw. In this model, a circular saw is a line segment (in projection) that can move freely in empty space, but can only cut straight into a portion of material. Once a region of material is separated from the rest, it can be picked up and removed to allow the saw to move more freely. A polygon is called cuttable by a circular saw if it can be cut out of a convex shape of material by a sufficiently small circular saw. We prove that a polygon has this property precisely if it does not have two adjacent reflex vertices.

Comments:

This paper is also available from the electronic proceedings as http://www.cs.unb.ca/conf/cccg/eProceedings/36.ps.gz.

Length:

The paper is 6 pages and the talk is 25 minutes.

Availability:

The paper is available in PostScript (307k).

See information on file formats.

[Google Scholar search]

Related papers:

CircularSawCGTA (Polygons Cuttable by a Circular Saw)