Compatible Triangulations and Point Partitions by Series-Triangular Graphs

Details Compatible Triangulations and Point Partitions by Series-Triangular Graphs Compatible Triangulations and Point Partitions by Series-Triangular Graphs

2005-02-08

arxiv.org/abs/cs/0502043v1

Computational Geometry: Theory and Applications, 34 (2006) 195-202

Computer Science

Computational Geometry

11 pages, 8 figures

Scientific paper

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets. The problem is generalized to finding compatible triangulations for more than two point sets and we show that such triangulations can be constructed with only a linear number of Steiner points added to each point set.

Affiliated with

Also associated with

No associations

Rating

Compatible Triangulations and Point Partitions by Series-Triangular Graphs 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 Compatible Triangulations and Point Partitions by Series-Triangular Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compatible Triangulations and Point Partitions by Series-Triangular Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-28068