Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm

09/19/2019
by   Andreas M. Tillmann, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2023

Simply Realising an Imprecise Polyline is NP-hard

We consider the problem of deciding, given a sequence of regions, if the...
research
09/19/2017

Tilt Assembly: Algorithms for Micro-Factories That Build Objects with Uniform External Forces

We present algorithmic results for the parallel assembly of many micro-s...
research
07/29/2016

Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machi...
research
05/24/2023

Approximating Multiobjective Optimization Problems: How exact can you be?

It is well known that, under very weak assumptions, multiobjective optim...
research
05/25/2022

The complexity of blocking (semi)total dominating sets with edge contractions

We consider the problem of reducing the (semi)total domination number of...
research
11/12/2021

Generalized Convexity Properties and Shape Based Approximation in Networks Reliability

Some properties of generalized convexity for sets and for functions are ...

Please sign up or login with your details

Forgot password? Click here to reset