Supporting Ruled Polygons
Computational Geometry
2017-07-05 v1 Data Structures and Algorithms
Abstract
We explore several problems related to ruled polygons. Given a ruling of a polygon , we consider the Reeb graph of induced by the ruling. We define the Reeb complexity of , which roughly equates to the minimum number of points necessary to support . We give asymptotically tight bounds on the Reeb complexity that are also tight up to a small additive constant. When restricted to the set of parallel rulings, we show that the Reeb complexity can be computed in polynomial time.
Cite
@article{arxiv.1707.00826,
title = {Supporting Ruled Polygons},
author = {Nicholas J. Cavanna and Marc Khoury and Donald R. Sheehy},
journal= {arXiv preprint arXiv:1707.00826},
year = {2017}
}
Comments
Canadian Conference on Computational Geometry 2017