Canadian Conference on Computational Geometry · 1998 · 14 citations · 0 references
ComputingComputer ScienceComputational GeometryGeometric OptimizationGeometry ProcessingGraph SimplificationGraph TheoryGeometry SimplificationSteiner Tree Problem
this paper we have shown that the No Steiner Point Subdivision Simplification Problem is NP-Hard. Recently, we have also shown that this problem is MIN PB complete, obtaining n