Abstract
We investigate computability of convex sets restricted to rational inputs. Several quite different algorithmic characterizations are presented, like the existence of effective approximations by polygons or effective line intersection tests. We also consider approximate computations of the n-fold characteristic function for several natural classes of convex sets. This yields many different concrete examples of (1, n)- computable sets.
Cite
CITATION STYLE
Kummer, M., & Schäfer, M. (1995). Computability of convex sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 900, pp. 550–561). Springer Verlag. https://doi.org/10.1007/3-540-59042-0_104
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
