arXiv Open Access 2014

Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation

Sayan Bandyapadhyay Santanu Bhowmick Kasturi Varadarajan

Lihat Sumber

Abstrak

We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees.

Topik & Kata Kunci

cs.CG

Penulis (3)

Sayan Bandyapadhyay

Santanu Bhowmick

Kasturi Varadarajan

Format Sitasi

APA MLA BibTeX

Bandyapadhyay, S., Bhowmick, S., Varadarajan, K. (2014). Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. https://arxiv.org/abs/1404.3776

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2014
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓