在有界点集上嵌入平衡二叉树
Embedding a balanced binary tree on a bounded point set
摘要：
给定一个具有n个顶点的无向平面图G和一个位于简单多边形P内的n个点的集合S，G在S上的点集嵌入是G的一个平面图，使得每个顶点映射到S的一个不同点，并且边是由P包围的多边形链。本文给出了一个新的算法，它在O（m^2 + n（log n）^2 + mn）时间内把一个n点平衡二叉树BBT嵌入到一个由m边形P围成的n点集S上，每条边最多有O（m）次弯曲.
英文摘要：
Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P, a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P. A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm for embedding an n-vertex balanced binary tree BBT on a set S of n points bounded by a simple m-gon P in O(m^2 + n(log n)^2 + mn) time with at most O(m) bends per edge.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
