We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …

Triangulation of planar graphs under constraints is a fundamental problem in the
representation of objects. Related keywords are graph augmentation from the field of graph …

Graph augmentation problems are motivated by network design and have been studied
extensively in optimization. We consider augmentation problems over plane geometric …

Let S be a set of n⩾ 4 points in general position in the plane, and let h< n be the number of
extreme points of S. We show how to construct a 3-connected plane graph with vertex set S …

We study biplane graphs drawn on a finite point set SS in the plane in general position. This
is the family of geometric graphs whose vertex set is SS and which can be decomposed into …

High-altitude platforms (HAPs) are autonomous airships or airplanes that fly beyond 20
kilometers in the ozone to build a telecommunications network or do remote sensing …

Given a set of n disjoint line segments in the plane, the segment visibility graph is the graph
whose 2n vertices correspond to the endpoints of the line segments and whose edges …

Cubic graph, where all vertices have degree three can be associated as 3-regular graph
and trivalent graph. Let a point P be the given point set, with a stipulation of n≥ 4 points in …

We introduce series-triangular graph embeddings and show how to partition point sets with
them. This result is then used to prove an upper bound on the number of Steiner points …

В работе исследуется вычислительная сложность задачи вершинного покрытия в
классе простых планарных графов (планарных триангуляций), допускающих плоское …