Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm
| Autor: | Leif Kobbelt, Andreas M. Tillmann |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Computational Geometry (cs.CG)
FOS: Computer and information sciences Control and Optimization Orientation (computer vision) Shape approximation Sampling (statistics) 020207 software engineering 02 engineering and technology Computer Science Applications Computational Mathematics Cardinality Computational Theory and Mathematics Optimization and Control (math.OC) Simple (abstract algebra) FOS: Mathematics 0202 electrical engineering electronic engineering information engineering Computer Science - Computational Geometry Node (circuits) Geometry and Topology Minification Enhanced Data Rates for GSM Evolution Algorithm Mathematics - Optimization and Control Mathematics |
| Popis: | We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and orientation restrictions. We show that already deciding feasibility of such approximation problems is NP -hard, and remains intractable even for very simple setups. We then devise an algorithmic framework that combines shape sampling with exact cardinality minimization to obtain good approximations using few components. As a particular application and showcase example, we discuss approximating shape contours using the classical Zometool construction kit and provide promising computational results, demonstrating that our algorithm is capable of obtaining good shape representations within reasonable time, in spite of the problem's general intractability. We conclude the paper with an outlook on possible extensions of the developed methodology, in particular regarding 3D shape approximation tasks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|