Computational Geometry
-
Covering polygons is hard.
-
Joseph C. Culberson, and Robert A. Reckhow.
Journal of Algorithms 17, 2-44, 1994.
Abstract
-
Covering polygons is hard: preliminary abstract.
-
Joseph C. Culberson and Robert A. Reckhow.
In 29th Annual Symposium on Foundations of Computer Science,
vol 21, pages 601-611, White Plains, New York, October 1988.
Abstract
-
Orthogonally convex coverings of orthogonal polygons without holes.
-
Joseph Culberson and Robert A. Reckhow.
Journal of Computer and System Sciences, vol 39(2), 166-204,
October 1989.
Abstract
-
Covering a simple orthogonal polygon with a minimum number of
orthogonally convex polygons.
-
Robert A. Reckhow and Joseph Culberson.
In Proceedings of the Third Annual Symposium on Computational
Geometry, pages 268-277, June 1987.
Abstract
-
Turtlegons: Generating Simple Polygons from Sequences of Angles.
-
Joseph C. Culberson and Gregory J. E. Rawlins, In
Proceedings of the First Annual Symposium on Computational Geometry
pages 305-310, 1985.
Abstract
-
TR89-06: A unified approach to orthogonal polygon covering problems via dent
diagrams.
-
Joseph C. Culberson and Robert A. Reckhow.
February 1989.
Abstract
Joseph Culberson
Nov 21, 1995