TY - JOUR

T1 - Approximate shape fitting via linearization

AU - Har-Peled, Sariel

AU - Varadarajan, Kasturi R.

PY - 2001

Y1 - 2001

N2 - Shape fitting is a fundamental optimization problem in computer science. In this paper, we present a general and unified technique for solving a certain family of such problems. Given a point set P in Rd this technique can be used to ε-approximate: (i) the min-width annulus and shell that contains P, (ii) minimum width cylindrical shell containing P, (iii) diameter, width, minimum volume bounding box of P, and (iv) all the previous measures for the case the points are moving. The running time of the resulting algorithms is O(n + 1/εc), where c is a constant that depends on the problem at hand. Our new general technique enables us to solve those problems without resorting to a careful and painful case by case analysis, as was previously done for those problems. Furthermore, for several of those problems our results are considerably simpler and faster than what was previously known. In particular, for the minimum width cylindrical shell problem, our solution is the first algorithm whose running time is subquadratic in n. (In fact we get running time linear in n.).

AB - Shape fitting is a fundamental optimization problem in computer science. In this paper, we present a general and unified technique for solving a certain family of such problems. Given a point set P in Rd this technique can be used to ε-approximate: (i) the min-width annulus and shell that contains P, (ii) minimum width cylindrical shell containing P, (iii) diameter, width, minimum volume bounding box of P, and (iv) all the previous measures for the case the points are moving. The running time of the resulting algorithms is O(n + 1/εc), where c is a constant that depends on the problem at hand. Our new general technique enables us to solve those problems without resorting to a careful and painful case by case analysis, as was previously done for those problems. Furthermore, for several of those problems our results are considerably simpler and faster than what was previously known. In particular, for the minimum width cylindrical shell problem, our solution is the first algorithm whose running time is subquadratic in n. (In fact we get running time linear in n.).

UR - http://www.scopus.com/inward/record.url?scp=0035175322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035175322&partnerID=8YFLogxK

U2 - 10.1109/SFCS.2001.959881

DO - 10.1109/SFCS.2001.959881

M3 - Article

AN - SCOPUS:0035175322

SP - 66

EP - 73

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

SN - 0272-5428

ER -