On joint triangulations of two sets of points in the plane

Details On joint triangulations of two sets of points in the plane On joint triangulations of two sets of points in the plane

2011-02-07

arxiv.org/abs/1102.1235v1

Computer Science

Discrete Mathematics

The extended abstrat of this paper appeared in the Proceedings of India-Taiwan Conference on Discrete Mathematics, Taipei, pp.

Scientific paper

In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the problem of a joint triangulation of two simple polygons of $n$ vertices, we propose an $O(n^3)$ time algorithm for constructing a joint triangulation using dynamic programming.

Affiliated with

Also associated with

No associations

Rating

On joint triangulations of two sets of points in the plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On joint triangulations of two sets of points in the plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On joint triangulations of two sets of points in the plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680881