A human observer can effortlessly identify visible portions of geometric objects present in the
environment. However, computations of visible portions of objects from a viewpoint involving …

The majority of planning algorithms used are based on the occupancy grid maps, but in
complicated situations, the occupancy grid maps have a significant search overhead. This …

We propose heuristics for visibility coverage of a polygon with the fewest point guards. This
optimal coverage problem, often called the" art gallery problem", is known to be NP-hard, so …

Let F be a set of n objects in the plane and let G×(F) be its intersection graph. A balanced
clique-based separator of G×(F) is a set S consisting of cliques whose removal partitions …

Let P be a set of 2n points in the plane, and let MC (resp., M NC) denote a bottleneck
matching (resp., a bottleneck non-crossing matching) of P. We study the problem of …

We study the problem of visibility in polyhedral terrains in the presence of multiple
viewpoints. We consider a triangulated terrain with m> 1 viewpoints (or guards) located on …

We present a general technique, based on parametric search with some twist, for solving a
variety of optimization problems on a set of semi-algebraic geometric objects of constant …

针对当前体参数化模型构建过程中需要进行模型分割的问题, 提出一种基于曲线几何特征的曲
多边形四边剖分算法. 首先定义轮廓曲线, 内外连接线, 轮廓多边形等特征 …

Most diagram editors and graph construction tools provide some form of automatic
connector routing, typically providing orthogonal or poly-line connectors. Usually the editor …

We consider the following geometric optimization problem: find a convex polygon of
maximum area contained in a given simple polygon P with n vertices. We give a randomized …