|
|||||
|
|
Strategies for polyhedral surface decomposition: An experimental study |
|
| Authors: | Bernard Chazelle David P. Dobkin Nadia Shouraboura Ayellet Tal |
| Affiliation: | a Department of Computer Science, Princeton University, Princeton, NJ 08544, USA b Program in Applied and Comput. Math., Princeton University, Princeton, NJ, USA c Department of Computer Science, Weizmann Institute, Israel |
| Abstract: | This paper addresses the problem of decomposing a complex polyhedral surface into a small number of “convex” patches (i.e., boundary parts of convex polyhedra). The corresponding optimization problem is shown to be NP-complete and an experimental search for good heuristics is undertaken. |
| Keywords: | NP-completeness 3-SAT Convexity Surface decomposition Flooding heuristics |
| 本文献已被 ScienceDirect 等数据库收录！ | |