Alexei Gorpinevich

  • Citations Per Year
Learn More
INTRODUCTION. The problem of dis~ecting a plane rectilinear polygon with rectilinear holes into a minimum number of rectang les is well–studied in computa– tional geometry. In the case of non-degenerate holes it is sol– 3’210gn) time, vable in O(n whe– re n is the number of vertices of the polygon (see [1]-[3]). If the holes of a rectilinear polygon are(More)
  • 1