Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number
classification
💻 cs.CG
keywords
approximationcounterexamplefindingminimumnumberrectilinearstabbingalgorithm
read the original abstract
This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.