On joint triangulations of two sets of points in the plane
Discrete Mathematics
2011-02-08 v1 Computational Geometry
Abstract
In this paper, we establish two necessary conditions for a joint triangulation of two sets of points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in time. For the problem of a joint triangulation of two simple polygons of vertices, we propose an time algorithm for constructing a joint triangulation using dynamic programming.
Keywords
Cite
@article{arxiv.1102.1235,
title = {On joint triangulations of two sets of points in the plane},
author = {Ajit Arvind Diwan and Subir Kumar Ghosh and Partha Pratim Goswami and Andrzej Lingas},
journal= {arXiv preprint arXiv:1102.1235},
year = {2011}
}
Comments
The extended abstrat of this paper appeared in the Proceedings of India-Taiwan Conference on Discrete Mathematics, Taipei, pp. 34-43, 2009