Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
Anubhav Dhar, Subham Ghosh, Sudeshna Kolay
Let be an orthogonal polygon of vertices, without holes. The Orthogonal Polygon Covering with Squares (OPCS) problem takes as input such an orthogonal polygon with inte…
cs.CG2023
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
Anubhav Dhar, Soumita Hait, Sudeshna Kolay
The Euclidean Steiner Minimal Tree problem takes as input a set of points in the Euclidean plane and finds the minimum length network interconnecting all the points of…